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

Volume 26, issue 6, 2023

Mathematical challenges in scheduling theory pp. 519-521

Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram and Guochuan Zhang

Approximation algorithms for batch scheduling with processing set restrictions pp. 523-533

Xing Chai, Wenhua Li, C. T. Ng and T. C. E. Cheng

Competitive algorithms for demand response management in a smart grid pp. 535-542

Vincent Chau, Shengzhong Feng and Nguyễn Kim Thắng

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints pp. 543-558

Kameng Nip and Zhenbo Wang

An improved approximation algorithm for a scheduling problem with transporter coordination pp. 559-570

Yinling Wang, Xin Han, Yong Zhang and Jacek Blazewicz

Scheduling on a graph with release times pp. 571-580

Wei Yu, Mordecai Golin and Guochuan Zhang

Volume 26, issue 5, 2023

Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems pp. 411-411

Samir Khuller

The flexibility of home away pattern sets pp. 413-423

Roel Lambers, Dries Goossens and Frits C. R. Spieksma

Malleable scheduling beyond identical machines pp. 425-442

Dimitris Fotakis, Jannik Matuschke and Orestis Papadigenopoulos

Well-behaved online load balancing against strategic jobs pp. 443-455

Bo Li, Minming Li and Xiaowei Wu

Local search approaches for the test laboratory scheduling problem with variable task grouping pp. 457-477

Florian Mischek, Nysret Musliu and Andrea Schaerf

Graph representation of the fixed route dial-a-ride problem pp. 479-495

Tal Grinshpoun, Elad Shufan, Hagai Ilani, Vadim Levit and Haya Brama

Simulated annealing with penalization for university course timetabling pp. 497-517

Kadri Sylejmani, Edon Gashi and Adrian Ymeri

Volume 26, issue 4, 2023

Lot streaming for a two-stage assembly system in the presence of handling costs pp. 335-351

Niloy J. Mukherjee, Subhash C. Sarin and Daniel A. Neira

Exact and metaheuristic methods for a real-world examination timetabling problem pp. 353-367

Mats Carlsson, Sara Ceschia, Luca Gaspero, Rasmus Ørnstrup Mikkelsen, Andrea Schaerf and Thomas Jacob Riis Stidsen

A multivariate complexity analysis of the material consumption scheduling problem pp. 369-382

Matthias Bentert, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk and Rolf Niedermeier

Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms pp. 383-398

Fangfang Wu, Zhongyi Jiang, Run Zhang and Xiandong Zhang

A note on the shifting bottleneck procedure for job shop scheduling pp. 399-402

Murat Güngör

A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence pp. 403-409

Enrique Gerstl and Gur Mosheiov

Volume 26, issue 3, 2023

Competitive two-agent scheduling with release dates and preemption on a single machine pp. 227-249

Shi-Sheng Li and Ren-Xia Chen

Optimization of scheduling problems with deterioration effects and an optional maintenance activity pp. 251-266

Xinyu Sun, Tao Liu, Xin-Na Geng, Yang Hu and Jing-Xiao Xu

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs pp. 267-287

Ulrich Pferschy, Julia Resch and Giovanni Righini

Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling pp. 289-314

Yannik Zeiträg and José Rui Figueira

A note on a single-shift days-off scheduling problem with sequence-dependent labor costs pp. 315-329

Eiji Mizutani and Kevin Alexander Sánchez Galeano

On the complexity of open shop scheduling with time lags pp. 331-334

Wiesław Kubiak

Volume 26, issue 2, 2023

Scheduling a pick and place packaging line pp. 113-136

Tommaso Schettini, Federico Malucelli and Helena Ramalhinho

Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using Inclusion–Exclusion pp. 137-145

Olivier Ploton and Vincent T’kindt

Minimizing the expected waiting time of emergency jobs pp. 147-167

Arne Schulz and Malte Fliedner

A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty pp. 169-191

François Clautiaux, Boris Detienne and Henri Lefebvre

Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection pp. 193-207

Matan Atsmony and Gur Mosheiov

Equitable scheduling on a single machine pp. 209-225

Klaus Heeger, Danny Hermelin, George B. Mertzios, Hendrik Molter, Rolf Niedermeier and Dvir Shabtay

Volume 26, issue 1, 2023

Editorial: Journal of Scheduling (2023) pp. 1-2

Edmund Burke

A quest for a fair schedule: The International Young Physicists’ Tournament pp. 3-18

Katarína Cechlárová, Ágnes Cseh, Zsuzsanna Jankó, Marián Kireš and Lukáš Miňo

How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring pp. 19-41

Nils Boysen, Dirk Briskorn and Stefan Schwerdfeger

Collaborative optimization of workshop layout and scheduling pp. 43-59

Yaliang Wang, Xinyu Fan, Chendi Ni, Kanghong Gao and Shousong Jin

Parallel solutions for preemptive makespan scheduling on two identical machines pp. 61-76

Leah Epstein

Joint replenishment meets scheduling pp. 77-94

Péter Györgyi, Tamás Kis, Tímea Tamási and József Békési

A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints pp. 95-111

Kai Watermeyer and Jürgen Zimmermann