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 25, issue 6, 2022

In memoriam Moshe Dror pp. 623-623

Jacek Blazewicz

Robust finite-horizon scheduling/rescheduling of operating rooms with elective and emergency surgeries under resource constraints pp. 625-641

F. Davarian and J. Behnamian

Online algorithms to schedule a proportionate flexible flow shop of batching machines pp. 643-657

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

Preemptive and non-preemptive scheduling on two unrelated parallel machines pp. 659-674

Alan J. Soper and Vitaly A. Strusevich

Packing-based branch-and-bound for discrete malleable task scheduling pp. 675-704

Roland Braune

Integrated break and carryover effect minimization pp. 705-719

Burak Çavdaroğlu and Tankut Atan

Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs pp. 721-740

Myungho Lee, Kangbok Lee and Michael Pinedo

Volume 25, issue 5, 2022

In memoriam Gerhard Woeginger pp. 503-505

Jan Karel Lenstra, Franz Rendl, Frits Spieksma and Marc Uetz

Exact and metaheuristic approaches for unrelated parallel machine scheduling pp. 507-534

Maximilian Moser, Nysret Musliu, Andrea Schaerf and Felix Winter

Maximizing barrier coverage lifetime with static sensors pp. 535-545

Menachem Poss and Dror Rawitz

A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes pp. 547-565

Biji Nair and S. Mary Saira Bhanu

Optimal energy scheduling of micro-grids considering the uncertainty of solar and wind renewable resources pp. 567-576

Mohammad Ali Taghikhani and Behnam Zangeneh

On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates pp. 577-587

Gur Mosheiov, Daniel Oron and Dvir Shabtay

An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems pp. 589-621

Omid Shahvari, Rasaratnam Logendran and Madjid Tavana

Volume 25, issue 4, 2022

Introducing UniCorT: an iterative university course timetabling tool with MaxSAT pp. 371-390

Alexandre Lemos, Pedro T. Monteiro and Inês Lynce

A mixed-integer programming approach for solving university course timetabling problems pp. 391-404

Efstratios Rappos, Eric Thiémard, Stephan Robert and Jean-François Hêche

A graph-based MIP formulation of the International Timetabling Competition 2019 pp. 405-428

Dennis S. Holm, Rasmus Ø. Mikkelsen, Matias Sørensen and Thomas J. R. Stidsen

A parallelized matheuristic for the International Timetabling Competition 2019 pp. 429-452

Rasmus Ø. Mikkelsen and Dennis S. Holm

A large neighborhood search approach for the paint shop scheduling problem pp. 453-475

Felix Winter and Nysret Musliu

Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation pp. 477-501

Can Akkan, Ayla Gülcü and Zeki Kuş

Volume 25, issue 3, 2022

Advances in the practice and theory of automated timetabling pp. 259-259

Ender Özcan, Patrick Causmaecker and Greet Vanden Berghe

Optimizing rest times and differences in games played: an iterative two-phase approach pp. 261-271

David Van Bulck and Dries Goossens

A fix-and-optimize heuristic for the ITC2021 sports timetabling problem pp. 273-286

George H. G. Fonseca and Túlio A. M. Toffolo

Pseudo-Boolean optimisation for RobinX sports timetabling pp. 287-299

Martin Mariusz Lester

Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 pp. 301-319

Roberto Maria Rosati, Matteo Petris, Luca Di Gaspero and Andrea Schaerf

Plant shutdown maintenance workforce team assignment and job scheduling pp. 321-338

Hesham K. Alfares

Exact and meta-heuristic approaches for the production leveling problem pp. 339-370

Johannes Vass, Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu and Felix Winter

Volume 25, issue 2, 2022

Further connections between contract-scheduling and ray-searching problems pp. 139-155

Spyros Angelopoulos

An analysis of the parameterized complexity of periodic timetabling pp. 157-176

Niels Lindner and Julian Reisch

Project scheduling in a lean environment to maximize value and minimize overruns pp. 177-190

Claudio Szwarcfiter, Yale T. Herer and Avraham Shtub

Single-machine scheduling with resource-dependent processing times and multiple unavailability periods pp. 191-202

Byung-Cheon Choi and Myoung-Ju Park

Aircraft landing planning under uncertain conditions pp. 203-228

Marie-Sklaerder Vié, Nicolas Zufferey and Roel Leus

A general scheme for solving a large set of scheduling problems with rejection in FPT time pp. 229-255

Danny Hermelin, Dvir Shabtay, Chen Zelig and Michael Pinedo

Correction to: Broadcasting a file in a communication network pp. 257-257

Kai-Simon Goetzmann, Tobias Harks and Max Klimm

Volume 25, issue 1, 2022

Editorial: Journal of Scheduling (2022) pp. 1-1

Edmund Burke

Twin-crane scheduling during seaside workload peaks with a dedicated handshake area pp. 3-34

Lennart Zey, Dirk Briskorn and Nils Boysen

Algorithm selection and instance space analysis for curriculum-based course timetabling pp. 35-58

Arnaud Coster, Nysret Musliu, Andrea Schaerf, Johannes Schoisswohl and Kate Smith-Miles

A flexible mixed integer programming-based system for real-world nurse rostering pp. 59-88

Elín Björk Böðvarsdóttir, Niels-Christian Fink Bagger, Laura Elise Høffner and Thomas J. R. Stidsen

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times pp. 89-105

Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour and David Duvivier

Scheduling computations with provably low synchronization overheads pp. 107-124

Guilherme Rito and Hervé Paulino

Minimizing the makespan on a single machine subject to modular setups pp. 125-137

Dirk Briskorn, Konrad Stephan and Nils Boysen

Volume 24, issue 6, 2021

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates pp. 553-567

Baruch Mor, Gur Mosheiov and Dvir Shabtay

Column generation for minimizing total completion time in a parallel-batching environment pp. 569-588

A. Alfieri, A. Druetto, A. Grosso and F. Salassa

More on ordered open end bin packing pp. 589-614

János Balogh, Leah Epstein and Asaf Levin

Theoretical and practical issues in single-machine scheduling with two job release and delivery times pp. 615-647

Alejandro Reynoso and Nodari Vakhania

Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time pp. 649-662

Tianyu Wang and Odile Bellenguez

Optimally rescheduling jobs with a Last-In-First-Out buffer pp. 663-680

Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy, Julia Resch and Giovanni Righini

Volume 24, issue 5, 2021

New Perspectives in Scheduling Theory pp. 455-457

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

Calibrations scheduling with arbitrary lengths and activation length pp. 459-467

Eric Angel, Evripidis Bampis, Vincent Chau and Vassilis Zissimopoulos

Scheduling periodic I/O access with bi-colored chains: models and algorithms pp. 469-481

Emmanuel Jeannot, Guillaume Pallez and Nicolas Vidal

Mirror scheduling problems with early work and late work criteria pp. 483-487

Xin Chen, Sergey Kovalev, Małgorzata Sterna and Jacek Błażewicz

An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping pp. 489-505

Tomasz Ciesielczyk, Alberto Cabrera, Ariel Oleksiak, Wojciech Piątek, Grzegorz Waligóra, Francisco Almeida and Vicente Blanco

Scheduling divisible loads with time and cost constraints pp. 507-521

M. Drozdowski and N. V. Shakhlevich

Stand-alone renewable power system scheduling for a green data center using integer linear programming pp. 523-541

Maroua Haddad, Jean-Marc Nicod, Marie-Cécile Péra and Christophe Varnier

A new LP rounding algorithm for the active time problem pp. 543-552

Gruia Cǎlinescu and Kai Wang

Volume 24, issue 4, 2021

Routing two stacking cranes with predetermined container sequences pp. 367-380

Dirk Briskorn

Scheduling with gaps: new models and algorithms pp. 381-403

Marek Chrobak, Mordecai Golin, Tak-Wah Lam and Dorian Nogneng

A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing pp. 405-412

Antonina P. Khramova and Ilya Chernykh

A memetic algorithm to address the multi-node resource-constrained project scheduling problem pp. 413-429

Luis F. Machado-Domínguez, Carlos D. Paternina-Arboleda, Jorge I. Vélez and Agustin Barrios-Sarmiento

Online scheduling to minimize total weighted (modified) earliness and tardiness cost pp. 431-446

Arman Jabbari and Philip M. Kaminsky

A note on the complexity of two supply chain scheduling problems pp. 447-454

Yuan Zhang and Jinjiang Yuan

Volume 24, issue 3, 2021

A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource pp. 259-267

Susumu Hashimoto and Shinji Mizuno

Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics pp. 269-290

Felix Hübner, Patrick Gerhards, Christian Stürck and Rebekka Volk

Scheduling for multi-robot routing with blocking and enabling constraints pp. 291-318

Jayanth Krishna Mogali, Joris Kinable, Stephen F. Smith and Zachary B. Rubinstein

Makespan minimization with OR-precedence constraints pp. 319-328

Felix Happach

A hybrid evolutionary approach to job-shop scheduling with generic time lags pp. 329-346

Madiha Harrabi, Olfa Belkahla Driss and Khaled Ghedira

Quantifying and enforcing robustness in staff rostering pp. 347-366

Toni I. Wickert, Pieter Smet and Greet Vanden Berghe

Volume 24, issue 2, 2021

Cyclic lot-sizing problems with sequencing costs pp. 123-135

Alexander Grigoriev, Vincent J. Kreuzen and Tim Oosterwijk

Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty pp. 137-174

Shoufeng Ma, Hongming Li, Ning Zhu and Chenyi Fu

Multiple dispatching rules allocation in real time using data mining, genetic algorithms, and simulation pp. 175-196

Mohamed Habib Zahmani and Baghdad Atmani

Three-machine open shop with a bottleneck machine revisited pp. 197-208

Inna G. Drobouchevitch

Scheduling coupled tasks with exact delays for minimum total job completion time pp. 209-221

Bo Chen and Xiandong Zhang

Coupled task scheduling with time-dependent processing times pp. 223-236

Mostafa Khatami and Amir Salehipour

Approximate and robust bounded job start scheduling for Royal Mail delivery offices pp. 237-258

Dimitrios Letsios, Jeremy T. Bradley, Suraj G, Ruth Misener and Natasha Page

Volume 24, issue 1, 2021

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

Edmund Burke

An integrated rolling horizon approach to increase operating theatre efficiency pp. 3-25

Belinda Spratt and Erhan Kozan

New results for scheduling to minimize tardiness on one machine with rejection and related problems pp. 27-34

Christos Koulamas and George Steiner

Disruptions in timetables: a case study at Universidade de Lisboa pp. 35-48

Alexandre Lemos, Pedro T. Monteiro and Inês Lynce

A joint order acceptance and scheduling problem with earliness and tardiness penalties considering overtime pp. 49-68

Xin Li, José A. Ventura and Kevin A. Bunn

Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems pp. 69-82

Rajesh Devaraj, Arnab Sarkar and Santosh Biswas

Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs pp. 83-102

Michal Penn and Tal Raviv

Measuring the complexity of university timetabling instances pp. 103-121

Felipe Rosa-Rivera, Jose I. Nunez-Varela, Cesar A. Puente-Montejano and Sandra E. Nava-Muñoz