Journal of Scheduling

2016 - 2026

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 29, issue 4, 2026

Prof. Chris Potts, 1949–2026 pp. 277-278

Bo Chen, Nicholas G. Hall and Steef L. van de Velde

Branch-cut-and-price for open-shop scheduling problems with any regular minsum objective pp. 279-298

Simon Emde and Jens Lysgaard

Branching list scheduling algorithms for the identical parallel machine scheduling problem pp. 299-335

Hakim Hadj-Djilani, Louis-Claude Canon, Laurent Philippe and Julien Bernard

Just-in-time scheduling with battery constraints pp. 337-353

Byung-Cheon Choi, Myoung-Ju Park, Jibok Chung and Kyung-Min Kim

A Tepid-Aware container scheduler for serverless computing environments targeting throughput and energy efficiency pp. 355-374

Mahrad Hanaforoosh, Mehrdad Ashtiani and Mohammad Abdollahi Azgomi

Computational complexity and exact techniques for scheduling problems with job prohibitions pp. 375-392

Yulia Zakharova

Correction: Computational complexity and exact techniques for scheduling problems with job prohibitions pp. 393-393

Yulia Zakharova

Volume 29, issue 3, 2026

The (a)social exam invigilator assignment problem pp. 185-202

Hannah Verplancke, David Van Bulck, Veronique Limère and Nico André Schmid

Efficient approximation algorithms for scheduling problems with uniform p-batch machines and arbitrary processing set restrictions pp. 203-228

Sergey Sevastyanov

A Mission planning algorithm inspired by temporal difference learning for minimizing Makespan pp. 229-243

Nam Eung Hwang, Joon Won Kim and Hyung Jun Kim

Single-machine and flow-shop scheduling with supporting tasks in a nested structure pp. 245-260

Renjie Yu, Daniel Oron and Bertrand M. T. Lin

Energy-aware priority-based task scheduling in a dynamic cloud environment pp. 261-275

Parvaz Ahmad Malla, Sheikh Umar Mushtaq and Sophiya Sheikh

Volume 29, issue 2, 2026

Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities pp. 111-124

Yao-Wen Sang, Jun-Qiang Wang, Yumei Huo, Małgorzata Sterna and Jacek Błażewicz

An update on the asymptotic optimality of the longest processing time heuristic pp. 125-141

Anne Benoit, Louis-Claude Canon, Redouane Elghazi and Pierre-Cyrille Héam

A scheduling game on parallel batch machines with setup cost pp. 143-156

Guo-Qiang Fan, Jun-Qiang Wang and Zhixin Liu

Optimal energy scheduling under time-of-use tariffs pp. 157-171

Nicholas G. Hall and Marc E. Posner

Scheduling cool jobs when processing heats them pp. 173-184

Roel Lambers, Rudi Pendavingh, Frits C. R. Spieksma and Céline M. F. Swennenhuis

Volume 29, issue 1, 2026

A review of multi-objective optimization methods for personnel rostering problems pp. 1-19

Elín Björk Böðvarsdóttir and Thomas Stidsen

Machine learning in project schedule creation: a systematic literature review pp. 21-38

Maciej Koszykowski and Witold Orzeszko

Resource leveling with subcontracting: algorithms and complexity pp. 39-50

Nicholas G. Hall and Marc E. Posner

Semi-online models for cardinality constrained bin packing pp. 51-66

Leah Epstein and Asaf Levin

Robust personnel rostering: How accurate should absenteeism predictions be? pp. 67-82

Martina Doneda, Pieter Smet, Giuliana Carello, Ettore Lanzarone and Greet Vanden Berghe

A study of different preemption types to facilitate the recovery of personnel task schedules pp. 83-109

Tessa Borgonjon and Broos Maenhout

Volume 28, issue 6, 2025

Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work pp. 563-576

Byung-Cheon Choi, Myoung-Ju Park and Kyung Min Kim

A cut-and-branch algorithm for the external candidates examination scheduling problem pp. 577-584

Pasquale Avella, Maurizio Boccia, Carlo Mannino, Michele Mele and Sandro Viglione

Flow shops with reentry: The total weighted completion time objective pp. 585-600

Maximilian von Aspern, Felix Buld, Nicklas Klein and Michael Pinedo

Scheduling web banner advertisements with conflicts and time windows: a column generation-based solution approach pp. 601-613

Ali Amiri and Reza Barkhi

Sustainable scheduling for a flexible job shop considering batch processing and batch transportation strategies pp. 615-637

Enguang Guan, Jiahui Wang and Jianguo Duan

Volume 28, issue 5, 2025

Single machine rescheduling for new orders with maximum and total time disruption constraints pp. 469-482

Elena Rener, Fabio Salassa and Vincent T’kindt

A buffer allocation evolutionary algorithm for resource-constrained projects with activity clusters pp. 483-511

Fangfang Cao, Tom Servranckx, Zhengwen He and Mario Vanhoucke

Multiprocessor scheduling with testing: improved online algorithms and numerical experiments pp. 513-527

Mingyang Gong, Jing Fan, Guohui Lin, Bing Su, Zihan Su and Xiang Zhang

Lower bounds for online scheduling on four processors pp. 529-544

O. Braun, F. Chung and R. L. Graham

Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules pp. 545-562

Rafael Calegari, Flavio S. Fogliatto, Filipe R. Lucini, João B. G. Brito, Gabrielli H. Yamashita, Michel J. Anzanello, Guilherme L. Tortorella and Beatriz D. Schaan

Volume 28, issue 4, 2025

Polynomial-time solutions for minimizing total load on unrelated machines with position-dependent processing times and rate-modifying activities pp. 377-390

Baruch Mor, Gur Mosheiov and Dvir Shabtay

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities pp. 391-406

Peihai Liu, Manzhan Gu and Xiwen Lu

A hybrid approach for the dynamic flexible job shop scheduling problem considering machine failures pp. 407-424

Chong Peng, Zhongwen Zhang, T. Warren Liao, Hui Zhao and Yuzhen Cai

Learning to enumerate shifts for large-scale flexible personnel scheduling problems pp. 425-443

Farin Rastgar-Amini, Claudio Contardo, Guy Desaulniers and Maxime Gasse

Limited integrated production scheduling and vehicle routing in the steel industry pp. 445-467

Mei Xu, Feng Yang and Liyuan Lin

Volume 28, issue 3, 2025

Recoverable robust single machine scheduling with polyhedral uncertainty pp. 269-287

Matthew Bold and Marc Goerigk

A solution framework for multi-skilled project scheduling problems with hierarchical skills pp. 289-310

Jakob Snauwaert and Mario Vanhoucke

A graphical evaluation and review technique for scheduling construction projects pp. 311-328

K. Pregina and M. Ramesh Kannan

Task assignments with rotations and flexible shift starts to improve demand coverage and staff satisfaction in healthcare pp. 329-353

Jan Schoenfelder, Jakob Heins and Jens O. Brunner

Hybrid-sched: a QoS adaptive offline–online scheduler for real-time tasks on multi-cores pp. 355-375

Piyoosh Purushothaman Nair, Hareesh Reddi, Rajesh Devaraj and Arnab Sarkar

Volume 28, issue 2, 2025

Preface: the practice and theory of automated timetabling (2022) pp. 157-158

Ender Özcan, Patrick De Causmaecker, Greet Vanden Berghe and Dries Goossens

On the computation of robust examination timetables: methods and experimental results pp. 159-181

Bernd Bassimir and Rolf Wanka

A proven optimal result for a benchmark instance of the uncapacitated examination timetabling problem pp. 183-194

Angelos Dimitsas, Christos Gogos, Christos Valouxis, Vasileios Nastos and Panayiotis Alefragis

Modelling and solving the university course timetabling problem with hybrid teaching considerations pp. 195-215

Matthew Davison, Ahmed Kheiri and Konstantinos G. Zografos

Multi-neighbourhood simulated annealing for the ITC-2007 capacitated examination timetabling problem pp. 217-232

David Van Bulck, Dries Goossens and Andrea Schaerf

Solving the medical student scheduling problem using simulated annealing pp. 233-246

Eugenia Zanazzo, Sara Ceschia, Agostino Dovier and Andrea Schaerf

Real-world university course timetabling at the International Timetabling Competition 2019 pp. 247-267

Tomáš Müller, Hana Rudová and Zuzana Müllerová

Volume 28, issue 1, 2025

Scientific workflow scheduling algorithms in cloud environments: a comprehensive taxonomy, survey, and future directions pp. 1-63

Ehsan Saeedizade and Mehrdad Ashtiani

A hybrid local search algorithm for the continuous energy-constrained scheduling problem pp. 65-84

Roel Brouwer, Marjan Akker and Han Hoogeveen

Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance? pp. 85-99

Fernando Garza-Santisteban, Jorge Mario Cruz-Duarte, Ivan Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos and Hugo Terashima-Marín

Scheduling of e-commerce packaging machines: blocking machines and their impact on the performance–waste tradeoff pp. 101-120

Dirk Briskorn, Nils Boysen and Lennart Zey

On variants of a load-balancing problem with unit-load jobs pp. 121-138

Péter Györgyi, Tamás Kis and Evelin Szögi

Complexity of scheduling few types of jobs on related and unrelated machines pp. 139-156

Martin Koutecký and Johannes Zink