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