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 23, issue 6, 2020

Editorial: Dynamic Scheduling Problems pp. 629-630

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

Flowshop scheduling with learning effect and job rejection pp. 631-641

Baruch Mor, Gur Mosheiov and Dana Shapira

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times pp. 643-648

Nir Halman

Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing pp. 649-664

Shaojun Lu, Jun Pei, Xinbao Liu, Xiaofei Qian, Nenad Mladenovic and Panos M. Pardalos

Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects pp. 665-680

Alan J. Soper and Vitaly A. Strusevich

Scheduling in data gathering networks with background communications pp. 681-691

Joanna Berlińska

Approximation algorithms for energy-efficient scheduling of parallel jobs pp. 693-709

Alexander Kononov and Yulia Kovalenko

A periodic optimization approach to dynamic pickup and delivery problems with time windows pp. 711-731

Farzaneh Karami, Wim Vancroonenburg and Greet Vanden Berghe

New results for an open time-dependent scheduling problem pp. 733-744

Stanisław Gawiejnowicz and Wiesław Kurc

On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty pp. 745-749

Yakov Shafransky and Viktor Shinkarevich

Scheduling jobs with a V-shaped time-dependent processing time pp. 751-768

Helmut A. Sedding

Volume 23, issue 5, 2020

Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection pp. 525-538

Jinwen Ou

A decomposition heuristic for rotational workforce scheduling pp. 539-554

Tristan Becker

Dynamic speed scaling minimizing expected energy consumption for real-time tasks pp. 555-574

Bruno Gaujal, Alain Girault and Stephan Plassart

Scheduling a proportionate flow shop of batching machines pp. 575-593

Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich and Sven O. Krumke

Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments pp. 595-608

Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu and Guohui Lin

Serial-batching scheduling with two agents to minimize makespan and maximum cost pp. 609-617

Cheng He, Chunqi Xu and Hao Lin

Scheduling two projects with controllable processing times in a single-machine environment pp. 619-628

Byung-Cheon Choi and Myoung-Ju Park

Volume 23, issue 4, 2020

On the exact solution of a large class of parallel machine scheduling problems pp. 411-429

Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian and Eduardo Uchoa

An Efficient Filtering Algorithm for the Unary Resource Constraint with Transition Times and Optional Activities pp. 431-449

Sascha Cauwelaert, Cyrille Dejemeppe and Pierre Schaus

Interruptible algorithms for multiproblem solving pp. 451-464

Spyros Angelopoulos and Alejandro López-Ortiz

Interference aware scheduling of triple-crossover-cranes pp. 465-485

Dirk Briskorn and Lennart Zey

Mixed batch scheduling on identical machines pp. 487-496

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

Single-machine scheduling with multi-agents to minimize total weighted late work pp. 497-512

Shi-Sheng Li and Jin-Jiang Yuan

Benders decomposition for the mixed no-idle permutation flowshop scheduling problem pp. 513-523

Tolga Bektaş, Alper Hamzadayı and Rubén Ruiz

Volume 23, issue 3, 2020

Single machine scheduling to maximize the number of on-time jobs with generalized due-dates pp. 289-299

Enrique Gerstl and Gur Mosheiov

Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling pp. 301-325

Rob Eynde and Mario Vanhoucke

Two-machine flow shops with an optimal permutation schedule under a storage constraint pp. 327-336

Yunhong Min, Byung-Cheon Choi and Myoung-Ju Park

Optimizing the physician scheduling problem in a large hospital ward pp. 337-361

Renata Mansini and Roberto Zanotti

Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network pp. 363-377

Timo Gschwind, Stefan Irnich, Christian Tilk and Simon Emde

The optimal design of round-robin tournaments with three players pp. 379-396

Alex Krumer, Reut Megidish and Aner Sela

Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant pp. 397-410

Zachariah Stevenson, Ricardo Fukasawa and Luis Ricardez-Sandoval

Volume 23, issue 2, 2020

An optimal online algorithm for scheduling with general machine cost functions pp. 155-162

Islam Akaria and Leah Epstein

The Longest Processing Time rule for identical parallel machines revisited pp. 163-176

Federico Della Croce and Rosario Scatamacchia

The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers pp. 177-209

Ferdinand Kiermaier, Markus Frey and Jonathan F. Bard

Broadcasting a file in a communication network pp. 211-232

Kai-Simon Goetzmann, Tobias Harks and Max Klimm

A polyhedral study of event-based models for the resource-constrained project scheduling problem pp. 233-251

Alexander Tesch

The extended roster quality staffing problem: addressing roster quality variation within a staffing planning period pp. 253-264

Komarudin, Tim De Feyter, Marie-Anne Guerry and Greet Vanden Berghe

A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering pp. 265-288

Babak Akbarzadeh, Ghasem Moslehi, Mohammad Reisi-Nafchi and Broos Maenhout

Volume 23, issue 1, 2020

Journal of scheduling (2020) pp. 1-2

Edmund Burke and Michael Pinedo

A review of four decades of time-dependent scheduling: main results, new topics, and open problems pp. 3-47

Stanisław Gawiejnowicz

Metaheuristics for solving a multi-objective flow shop scheduling problem with sequence-dependent setup times pp. 49-69

V. Anjana, R. Sridharan and P. N. Ram Kumar

A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls pp. 71-93

Henriette Koch, Maximilian Schlögell and Andreas Bortfeldt

Minimizing the waiting time for a one-way shuttle service pp. 95-115

Laurent Daudet and Frédéric Meunier

Approximation algorithms for the twin robot scheduling problem pp. 117-133

Florian Jaehn and Andreas Wiehl

Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures pp. 135-143

Philippe Chrétienne

Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines pp. 145-154

S. S. Panwalkar and Christos Koulamas

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