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 22, issue 6, 2019
- Sequencing assembly lines to facilitate synchronized just-in-time part supply pp. 607-621

- Simon Emde and Lukas Polten
- Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints pp. 623-634

- Péter Györgyi and Tamás Kis
- Shop scheduling problems with pliable jobs pp. 635-661

- S. Knust, N. V. Shakhlevich, S. Waldherr and C. Weiß
- On the parameterized tractability of the just-in-time flow-shop scheduling problem pp. 663-676

- Danny Hermelin, Dvir Shabtay and Nimrod Talmon
- Single machine scheduling with stochastically dependent times pp. 677-689

- Wei Wei
- Single-machine scheduling with job-dependent machine deterioration pp. 691-707

- Wenchang Luo, Yao Xu, Weitian Tong and Guohui Lin
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time pp. 709-714

- Tianyu Wang and Odile Bellenguez-Morineau
Volume 22, issue 5, 2019
- A unified view of parallel machine scheduling with interdependent processing rates pp. 499-515

- Bahram Alidaee, Haibo Wang, R. Bryan Kethley and Frank Landram
- A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals pp. 517-541

- Amelie Eilken
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability pp. 543-565

- Kerem Bülbül, Safia Kedad-Sidhoum and Halil Şen
- Risk-averse single machine scheduling: complexity and approximation pp. 567-580

- Adam Kasperski and Paweł Zieliński
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs pp. 581-593

- Rubing Chen, Jinjiang Yuan and Yuan Gao
- Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines pp. 595-601

- Rubing Chen and Jinjiang Yuan
- Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity pp. 603-606

- Mikhail Y. Kovalyov and Dmitrij Šešok
Volume 22, issue 4, 2019
- The evolution of schematic representations of flow shop scheduling problems pp. 379-391

- S. S. Panwalkar and Christos Koulamas
- Malleable scheduling for flows of jobs and applications to MapReduce pp. 393-411

- Viswanath Nagarajan, Joel Wolf, Andrey Balmin and Kirsten Hildrum
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs pp. 413-431

- Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner and Jun-Min Wei
- Parallel machine makespan minimization subject to machine availability and total completion time constraints pp. 433-447

- Yumei Huo
- Unbounded parallel-batch scheduling with drop-line tasks pp. 449-463

- Yuan Gao, Jinjiang Yuan and Zhigang Wei
- The single-processor scheduling problem with time restrictions: complexity and related problems pp. 465-471

- Rachid Benmansour, Oliver Braun and Saïd Hanafi
- Quality of strong equilibria for selfish bin packing with uniform cost sharing pp. 473-485

- György Dósa and Leah Epstein
- Lower bounds for online bin covering-type problems pp. 487-497

- János Balogh, Leah Epstein and Asaf Levin
Volume 22, issue 3, 2019
- The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints pp. 263-269

- Tianyu Wang and Odile Bellenguez-Morineau
- Stochastic project management: multiple projects with multi-skilled human resources pp. 271-288

- Thomas Felberbauer, Walter J. Gutjahr and Karl F. Doerner
- An approximation scheme for the bi-scenario sum of completion times trade-off problem pp. 289-304

- Miri Gilenson, Hussein Naseraldin and Liron Yedidsion
- Parameterized complexity of a coupled-task scheduling problem pp. 305-313

- S. Bessy and R. Giroudeau
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria pp. 315-333

- Yunqiang Yin, Youhua Chen, Kaida Qin and Dujuan Wang
- Scheduling parallel batching machines in a sequence pp. 335-357

- Ward Passchyn and Frits C. R. Spieksma
- Multistage interval scheduling games pp. 359-377

- Arne Herzel, Michael Hopf and Clemens Thielen
Volume 22, issue 2, 2019
- Scheduling recurring radiotherapy appointments in an ion beam facility pp. 137-154

- Petra Vogl, Roland Braune and Karl F. Doerner
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem pp. 155-172

- Niels-Christian Fink Bagger, Guy Desaulniers and Jacques Desrosiers
- A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem pp. 173-182

- Alessandro Hill, Eduardo Lalla-Ruiz, Stefan Voß and Marcos Goycoolea
- Online pulse interleaving task scheduling for multifunction radar pp. 183-192

- Haowei Zhang, Junwei Xie, Qiyong Hu, Zhaojian Zhang and Binfeng Zong
- Correction to: Online pulse interleaving task scheduling for multifunction radar pp. 193-193

- Haowei Zhang, Junwei Xie, Qiyong Hu, Zhaojian Zhang and Binfeng Zong
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors pp. 195-209

- Sanjoy K. Baruah, Vincenzo Bonifaci, Renato Bruni and Alberto Marchetti-Spaccamela
- The proactive and reactive resource-constrained project scheduling problem pp. 211-237

- Morteza Davari and Erik Demeulemeester
- Scheduling problems over a network of machines pp. 239-253

- Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour and Yifeng Zhang
- A note on minimizing total weighted completion time with an unexpected machine unavailable interval pp. 255-262

- Peihai Liu, Chao Wang and Xiwen Lu
Volume 22, issue 1, 2019
- Journal of scheduling (2019) pp. 1-2

- Edmund Burke and Michael Pinedo
- Inductive $$k$$ k -independent graphs and c-colorable subgraphs in scheduling: a review pp. 3-20

- Matthias Bentert, René Bevern and Rolf Niedermeier
- A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems pp. 21-57

- Arthur Kramer and Anand Subramanian
- No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths pp. 59-68

- J.-C. Billaut, F. Della Croce, F. Salassa and V. T’kindt
- The venue management problem: setting staffing levels, shifts and shift schedules at concession stands pp. 69-83

- Oyku Ahipasaoglu, Nesim Erkip and Oya Ekin Karasan
- An efficient train scheduling algorithm on a single-track railway system pp. 85-105

- Xiaoming Xu, Keping Li, Lixing Yang and Ziyou Gao
- Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients pp. 107-118

- Francisco Ballestín, Ángeles Pérez and Sacramento Quintanilla
- A polynomial-time approximation scheme for the airplane refueling problem pp. 119-135

- Iftah Gamzu and Danny Segev
Volume 21, issue 6, 2018
- In memoriam: Dr. Joseph Leung pp. 579-580

- Nicholas G. Hall, Yumei Huo, Benjamin Li, Michael Pinedo and Hairong Zhao
- New challenges in scheduling theory pp. 581-582

- Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram and Guochuan Zhang
- Shared processor scheduling pp. 583-593

- Dariusz Dereniowski and Wiesław Kubiak
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines pp. 595-606

- Dominik Kress, Maksim Barketau and Erwin Pesch
- Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times pp. 607-617

- Marjan Akker, Han Hoogeveen and Judith Stoef
- Scheduling fully parallel jobs pp. 619-631

- Kai Wang, Vincent Chau and Minming Li
- Speed scaling problems with memory/cache consideration pp. 633-646

- Weiwei Wu, Minming Li, Kai Wang, He Huang and Enhong Chen
- Online scheduling of moldable parallel tasks pp. 647-654

- Deshi Ye, Danny Z. Chen and Guochuan Zhang
Volume 21, issue 5, 2018
- An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines pp. 483-492

- Manzhan Gu, Jinwei Gu and Xiwen Lu
- Scheduling meets n-fold integer programming pp. 493-503

- Dušan Knop and Martin Koutecký
- Models and algorithms for energy-efficient scheduling with immediate start of jobs pp. 505-516

- Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich and Bernhard Primas
- A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options pp. 517-531

- Douglas S. Altner, Anthony C. Rojas and Leslie D. Servi
- Admission control in shared memory switches pp. 533-543

- Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko and Alexander Sirotkin
- A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling pp. 545-563

- Pan Zou, Manik Rajora and Steven Y. Liang
- Rescheduling due to machine disruption to minimize the total weighted completion time pp. 565-578

- Wenchang Luo, Taibo Luo, Randy Goebel and Guohui Lin
Volume 21, issue 4, 2018
- Two-stage hybrid flowshop scheduling with simultaneous processing machines pp. 387-411

- Bailin Wang, Kai Huang and Tieke Li
- Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem pp. 413-428

- Helga Ingimundardottir and Thomas Philip Runarsson
- Online-bounded analysis pp. 429-441

- Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen and Asaf Levin
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines pp. 443-460

- Liang-Liang Fu, Mohamed Ali Aloulou and Christian Artigues
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time pp. 461-482

- Zhijun Xu and Dehua Xu
Volume 21, issue 3, 2018
- A survey on makespan minimization in semi-online environments pp. 269-284

- Leah Epstein
- An implicit model for multi-activity shift scheduling problems pp. 285-304

- Sana Dahmen, Monia Rekik and François Soumis
- The triangle scheduling problem pp. 305-312

- Christoph Dürr, Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez and Gerhard Woeginger
- Improved algorithms for resource allocation under varying capacity pp. 313-325

- Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambudha Roy and Yogish Sabharwal
- Flexible bandwidth assignment with application to optical networks pp. 327-336

- Hadas Shachnai, Ariella Voloshin and Shmuel Zaks
- Single machine scheduling with job delivery to multiple customers pp. 337-348

- Jianming Dong, Xueshi Wang, Jueliang Hu and Guohui Lin
- New strategies for stochastic resource-constrained project scheduling pp. 349-365

- Salim Rostami, Stefan Creemers and Roel Leus
- Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem pp. 367-386

- Lunce Fu and Maged Dessouky
Volume 21, issue 2, 2018
- Preface pp. 129-130

- Zdenek Hanzalek, Graham Kendall, Barry McCollum, Premysl Sucha and Greet Vanden Berghe
- A list-scheduling heuristic for the short-term planning of assessment centers pp. 131-142

- Adrian Zimmermann and Norbert Trautmann
- The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster pp. 143-165

- Jonas Ingels and Broos Maenhout
- Staff assignment with lexicographically ordered acceptance levels pp. 167-189

- Tom Rihm and Philipp Baumann
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints pp. 191-207

- Julia Lange and Frank Werner
- A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines pp. 209-226

- Yi Tan, Lars Mönch and John W. Fowler
- Exact exponential algorithms for 3-machine flowshop scheduling problems pp. 227-233

- Lei Shang, Christophe Lenté, Mathieu Liedloff and Vincent T’Kindt
- Family scheduling with batch availability in flow shops to minimize makespan pp. 235-249

- Liji Shen and Jatinder N. D. Gupta
- Multi-stage resource-aware scheduling for data centers with heterogeneous servers pp. 251-267

- Tony T. Tran, Meghana Padmanabhan, Peter Yun Zhang, Heyse Li, Douglas G. Down and J. Christopher Beck
Volume 21, issue 1, 2018
- Journal of Scheduling (2018) pp. 1-1

- Edmund Burke and Michael Pinedo
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems pp. 3-16

- D. Prot and O. Bellenguez-Morineau
- Case mix classification and a benchmark set for surgery scheduling pp. 17-33

- Gréanne Leeftink and Erwin W. Hans
- Energy-efficient scheduling and routing via randomized rounding pp. 35-51

- Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli and Maxim Sviridenko
- Solving a wind turbine maintenance scheduling problem pp. 53-76

- Aurélien Froger, Michel Gendreau, Jorge E. Mendoza, Eric Pinson and Louis-Martin Rousseau
- Scheduling shared continuous resources on many-cores pp. 77-92

- Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer Heide, Lars Nagel, Sören Riechers, Jiří Sgall and Tim Süß
- Task assignment with start time-dependent processing times for personnel at check-in counters pp. 93-109

- Emilio Zamorano, Annika Becker and Raik Stolletz
- Scheduling electric vehicles and locating charging stations on a path pp. 111-126

- Nils Boysen, Dirk Briskorn and Simon Emde
- The Current state of bounds on benchmark instances of the job-shop scheduling problem pp. 127-128

- Jelke J. Hoorn
| |