Journal of Scheduling
2016 - 2025
Current editor(s): Edmund Burke and Michael Pinedo From Springer Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing (). Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.
Volume 20, issue 6, 2017
- Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015) pp. 543-543

- Yves Crama, Dries Goossens, Roel Leus, Michaël Schyns and Frits Spieksma
- Minimizing worst-case and average-case makespan over scenarios pp. 545-555

- Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne Ster, Leen Stougie and Anke Zuylen
- Open Shop Scheduling with Synchronization pp. 557-581

- C. Weiß, S. Waldherr, S. Knust and N. V. Shakhlevich
- Single machine scheduling with a generalized job-dependent cumulative effect pp. 583-592

- Kabir Rustogi and Vitaly A. Strusevich
- Approximation for scheduling on uniform nonsimultaneous parallel machines pp. 593-600

- Liliana Grigoriu and Donald K. Friesen
- Online bin stretching with three bins pp. 601-621

- Martin Böhm, Jiří Sgall, Rob Stee and Pavel Veselý
- Scheduling multipacket frames with frame deadlines pp. 623-634

- Łukasz Jeż, Yishay Mansour and Boaz Patt-Shamir
- Staff and machine shift scheduling in a German potash mine pp. 635-656

- Marco Schulze and Jürgen Zimmermann
- LP rounding and combinatorial algorithms for minimizing active and busy time pp. 657-680

- Jessica Chang, Samir Khuller and Koyel Mukherjee
- Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence pp. 681-693

- Azeddine Cheref, Alessandro Agnetis, Christian Artigues and Jean-Charles Billaut
- Fault tolerant scheduling of tasks of two sizes under resource augmentation pp. 695-711

- Dariusz R. Kowalski, Prudence W. H. Wong and Elli Zavou
Volume 20, issue 5, 2017
- Reordering buffer management with advice pp. 423-442

- Anna Adamaszek, Marc P. Renault, Adi Rosén and Rob Stee
- Online interval scheduling with a bounded number of failures pp. 443-457

- Marco Bender, Clemens Thielen and Stephan Westphal
- Mathematical models for the berth allocation problem in dry bulk terminals pp. 459-473

- Andreas T. Ernst, Ceyda Oğuz, Gaurav Singh and Gita Taherkhani
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem pp. 475-491

- Cyril Briand, Sandra Ulrich Ngueveu and Přemysl Šůcha
- Scheduling cleaning activities on trains by minimizing idle times pp. 493-506

- Enrico Bartolini, Mauro Dell’Amico and Manuel Iori
- Crane scheduling in railway yards: an analysis of computational complexity pp. 507-526

- Konrad Stephan and Nils Boysen
- Offline first-fit decreasing height scheduling of power loads pp. 527-542

- Anshu Ranjan, Pramod Khargonekar and Sartaj Sahni
Volume 20, issue 4, 2017
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs pp. 313-335

- Yunqiang Yin, T. C. E. Cheng, Du-Juan Wang and Chin-Chia Wu
- Non-preemptive buffer management for latency sensitive packets pp. 337-353

- Moran Feldman and Joseph (Seffi) Naor
- An exact algorithm for parallel machine scheduling with conflicts pp. 355-372

- Daniel Kowalczyk and Roel Leus
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem pp. 373-389

- Kerem Bülbül and Halil Şen
- A neighborhood for complex job shop scheduling problems with regular objectives pp. 391-422

- Reinhard Bürgy
Volume 20, issue 3, 2017
- Continuous-time production, distribution and financial planning with periodic liquidity balancing pp. 219-237

- Wolfgang Albrecht and Martin Steinrücke
- The local–global conjecture for scheduling with non-linear cost pp. 239-254

- Nikhil Bansal, Christoph Dürr, Nguyen Kim Thang and Óscar C. Vásquez
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack pp. 255-265

- René Bevern, Rolf Niedermeier and Ondřej Suchý
- Optimal scheduling of contract algorithms with soft deadlines pp. 267-277

- Spyros Angelopoulos, Alejandro López-Ortiz and Angèle Hamel
- A greedy approximation algorithm for minimum-gap scheduling pp. 279-292

- Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li and Seffi Naor
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence pp. 293-302

- Bertrand M. T. Lin, F. J. Hwang and Jatinder N. D. Gupta
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays pp. 303-311

- Aurélien Carlier, Claire Hanen and Alix Munier Kordon
Volume 20, issue 2, 2017
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times pp. 115-127

- Leah Epstein and Ido Yatsiv
- Scheduling of multi-class multi-server queueing systems with abandonments pp. 129-145

- Urtzi Ayesta, Peter Jacko and Vladimír Novák
- Improved approaches to the exact solution of the machine covering problem pp. 147-164

- Rico Walter, Martin Wirth and Alexander Lawrinenko
- A hybrid multi-objective immune algorithm for predictive and reactive scheduling pp. 165-182

- Iwona Paprocka and Bożena Skołud
- Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations pp. 183-197

- Liliana Grigoriu and Dirk Briskorn
- Batched bin packing revisited pp. 199-209

- Gyorgy Dosa
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines pp. 211-218

- Jinjiang Yuan
Volume 20, issue 1, 2017
- Journal of Scheduling (2017) pp. 1-1

- Edmund Burke and Michael Pinedo
- Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs pp. 3-24

- Konstantinos G. Zografos, Michael A. Madas and Konstantinos N. Androutsopoulos
- Scheduling shipments in closed-loop sortation conveyors pp. 25-42

- Dirk Briskorn, Simon Emde and Nils Boysen
- Optimizing railway crew schedules with fairness preferences pp. 43-55

- Silke Jütte, Daniel Müller and Ulrich W. Thonemann
- An integrated model for the transshipment yard scheduling problem pp. 57-65

- Mateusz Cichenski, Florian Jaehn, Grzegorz Pawlak, Erwin Pesch, Gaurav Singh and Jacek Blazewicz
- Real-time management of berth allocation with stochastic arrival and handling times pp. 67-83

- Nitish Umang, Michel Bierlaire and Alan L. Erera
- Scheduling reclaimers serving a stock pad at a coal terminal pp. 85-101

- Thomas Kalinowski, Reena Kapoor and Martin W. P. Savelsbergh
- Optimization-based resource allocation for software as a service application in cloud computing pp. 103-113

- Chunlin Li, Yun Chang Liu and Xin Yan
Volume 19, issue 6, 2016
- New challenges in scheduling theory pp. 617-618

- Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram and Guochuan Zhang
- Throughput maximization for speed scaling with agreeable deadlines pp. 619-625

- Eric Angel, Evripidis Bampis, Vincent Chau and Dimitrios Letsios
- Co-scheduling algorithms for high-throughput workload execution pp. 627-640

- Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert and Padma Raghavan
- Optimizing memory allocation for multistage scheduling including setup times pp. 641-658

- Anne Benoit, Mathias Coqblin, Jean-Marc Nicod and Veronika Rehn-Sonigo
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines pp. 659-685

- Peter Brucker and Natalia V. Shakhlevich
- Scheduling for electricity cost in a smart grid pp. 687-699

- Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong and David K. Y. Yau
- Normal-form preemption sequences for an open problem in scheduling theory pp. 701-728

- Bo Chen, Ed Coffman, Dariusz Dereniowski and Wiesław Kubiak
- Scheduling on parallel identical machines with late work criterion: Offline and online cases pp. 729-736

- Xin Chen, Malgorzata Sterna, Xin Han and Jacek Blazewicz
- Scheduling with time-dependent discrepancy times pp. 737-757

- Florian Jaehn and Helmut A. Sedding
- On scheduling with non-increasing time slot cost to minimize total weighted completion time pp. 759-767

- Yingchao Zhao, Xiangtong Qi and Minming Li
Volume 19, issue 5, 2016
- Scheduling operating rooms: achievements, challenges and pitfalls pp. 493-525

- Michael Samudra, Carla Van Riet, Erik Demeulemeester, Brecht Cardoen, Nancy Vansteenkiste and Frank E. Rademakers
- Finding optimal tour schedules on transportation paths under extended time window constraints pp. 527-546

- Stefan Bock
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime pp. 547-561

- Peruvemba Sundaram Ravi, Levent Tunçel and Michael Huang
Volume 19, issue 4, 2016
- Late acceptance hill-climbing for high school timetabling pp. 453-465

- George H. G. Fonseca, Haroldo G. Santos and Eduardo G. Carrano
- Scheduling evacuation operations pp. 467-478

- Kaouthar Deghdak, Vincent T’kindt and Jean-Louis Bouquard
- A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling pp. 479-492

- Yuri Bykov and Sanja Petrovic
Volume 19, issue 3, 2016
- Preface pp. 213-213

- Graham Kendall, Greet Vanden Berghe and Barry McCollum
Volume 19, issue 2, 2016
- Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times pp. 165-176

- Xin Li and Richard Y. K. Fung
- A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem pp. 207-211

- Ivar Massabò, Giuseppe Paletta and Alex J. Ruiz-Torres
Volume 19, issue 1, 2016
- Journal of Scheduling (2016) pp. 1-1

- Edmund Burke and Michael Pinedo
- A survey of offline algorithms for energy minimization under deadline constraints pp. 3-19

- Marco E. T. Gerards, Johann L. Hurink and Philip K. F. Hölzenspies
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines pp. 21-31

- Kejun Zhao, Xiwen Lu and Manzhan Gu
- MP or not MP: that is the question pp. 33-42

- Federico Della Croce
- A genetic algorithm for the robust resource leveling problem pp. 43-60

- Hongbo Li and Erik Demeulemeester
| |