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 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

Volume 27, issue 6, 2024

Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment pp. 525-543

Julius Hoffmann, Janis S. Neufeld and Udo Buscher

Serial batching to minimize the weighted number of tardy jobs pp. 545-556

Danny Hermelin, Matthias Mnich and Simon Omlor

Network routing on regular digraphs and their line graphs pp. 557-564

Vance Faber and Noah Streib

Scheduling a single machine with multiple due dates per job pp. 565-585

Raphael Kühn, Christian Weiß, Heiner Ackermann and Sandy Heydrich

Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems pp. 587-606

Pascale Bendotti, Luca Brunod Indrigo, Philippe Chrétienne and Bruno Escoffier

Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling pp. 607-622

Tobias Geibinger, Florian Mischek and Nysret Musliu

Volume 27, issue 5, 2024

Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing pp. 409-422

Junying He, Soon-Ik Hong and Seong-Hee Kim

Short-term underground mine planning with uncertain activity durations using constraint programming pp. 423-439

Younes Aalian, Michel Gamache and Gilles Pesant

Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time pp. 441-459

Jianzhong Qiu, Jun Wu, Xi Chen, Bingyan Zhao and Yan Fang

Scheduling periodic messages on a shared link without buffering pp. 461-484

Maël Guiraud and Yann Strozecki

Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization pp. 485-505

Tifenn Rault, Faiza Sadi, Jean-Charles Billaut and Ameur Soukhal

Scheduling of Earth observing satellites using distributed constraint optimization pp. 507-524

Shai Krigman, Tal Grinshpoun and Lihi Dery

Volume 27, issue 4, 2024

Approximating weighted completion time via stronger negative correlation pp. 319-328

Alok Baveja, Xiaoran Qu and Aravind Srinivasan

An exact solution with an improved running time for the routing flow shop problem with two machines pp. 329-340

Ilya Chernykh, Alexander Kononov and Sergey Sevastyanov

Block-based state-expanded network models for multi-activity shift scheduling pp. 341-361

Michael Römer

Sequential solutions in machine scheduling games pp. 363-373

Cong Chen, Paul Giessler, Akaki Mamageishvili, Matúš Mihalák and Paolo Penna

Continuity of care in home health care scheduling: a rolling horizon approach pp. 375-392

Şeyma Güven-Koçak, Aliza Heching, Pınar Keskinocak and Alejandro Toriello

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses pp. 393-407

Michele Barbato, Alberto Ceselli and Giovanni Righini

Volume 27, issue 3, 2024

Dynamic scheduling problems in theory and practice pp. 225-226

Stanisław Gawiejnowicz, Bertrand Miao-Tsong Lin and Gur Mosheiov

Single machine scheduling with step-learning pp. 227-237

Matan Atsmony, Baruch Mor and Gur Mosheiov

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times pp. 239-256

Dvir Shabtay and Baruch Mor

Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time pp. 257-275

Helmut A. Sedding

Scheduling with periodic availability constraints to minimize makespan pp. 277-297

Lishi Yu and Zhiyi Tan

Improving scheduling in multi-AGV systems by task prediction pp. 299-308

Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan and Yaonan Wang

Single-machine primary–secondary scheduling with total tardiness being the primary criterion pp. 309-318

Qiulan Zhao and Jinjiang Yuan

Volume 27, issue 2, 2024

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines pp. 119-133

Claire Hanen and Alix Munier Kordon

A novel and efficient real-time sequencing strategy for appointment scheduling with unpunctual patients pp. 135-149

Chao Li, Zhi Yang, Fajun Yang and Feng Wang

Scheduling with non-renewable resources: minimizing the sum of completion times pp. 151-164

Kristóf Bérczi, Tamás Király and Simon Omlor

A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment pp. 165-182

Rachid Hassani, Guy Desaulniers and Issmail Elhallaoui

A scheduling framework for distributed key-value stores and its application to tail latency minimization pp. 183-202

Sonia Ben Mokhtar, Louis-Claude Canon, Anthony Dugois, Loris Marchal and Etienne Rivière

Preemptive scheduling of parallel jobs of two sizes with controllable processing times pp. 203-224

Akiyoshi Shioura, Vitaly A. Strusevich and Natalia V. Shakhlevich

Volume 27, issue 1, 2024

Dynamic personnel rescheduling: insights and recovery strategies pp. 1-27

Broos Maenhout and Mario Vanhoucke

A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing pp. 29-49

Frederik Ferid Ostermeier and Jochen Deuse

The price of anarchy for a berth allocation game pp. 51-60

Jiayin Pan, Cong Chen and Yinfeng Xu

Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits pp. 61-86

Xiaojuan Jiang, Kangbok Lee and Michael L. Pinedo

Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model pp. 87-101

Gabrijela Obradović, Ann-Brith Strömberg and Kristian Lundberg

The preemptive resource allocation problem pp. 103-118

Kanthi Sarpatwar, Baruch Schieber and Hadas Shachnai