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 21, issue 6, 2018

In memoriam: Dr. Joseph Leung pp. 579-580

Nicholas G. Hall, Yumei Huo, Benjamin Li, Michael Pinedo and Hairong Zhao

New challenges in scheduling theory pp. 581-582

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

Shared processor scheduling pp. 583-593

Dariusz Dereniowski and Wiesław Kubiak

Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines pp. 595-606

Dominik Kress, Maksim Barketau and Erwin Pesch

Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times pp. 607-617

Marjan Akker, Han Hoogeveen and Judith Stoef

Scheduling fully parallel jobs pp. 619-631

Kai Wang, Vincent Chau and Minming Li

Speed scaling problems with memory/cache consideration pp. 633-646

Weiwei Wu, Minming Li, Kai Wang, He Huang and Enhong Chen

Online scheduling of moldable parallel tasks pp. 647-654

Deshi Ye, Danny Z. Chen and Guochuan Zhang

Volume 21, issue 5, 2018

An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines pp. 483-492

Manzhan Gu, Jinwei Gu and Xiwen Lu

Scheduling meets n-fold integer programming pp. 493-503

Dušan Knop and Martin Koutecký

Models and algorithms for energy-efficient scheduling with immediate start of jobs pp. 505-516

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

A two-stage stochastic program for multi-shift, multi-analyst, workforce optimization with multiple on-call options pp. 517-531

Douglas S. Altner, Anthony C. Rojas and Leslie D. Servi

Admission control in shared memory switches pp. 533-543

Patrick Eugster, Alex Kesselman, Kirill Kogan, Sergey Nikolenko and Alexander Sirotkin

A new algorithm based on evolutionary computation for hierarchically coupled constraint optimization: methodology and application to assembly job-shop scheduling pp. 545-563

Pan Zou, Manik Rajora and Steven Y. Liang

Rescheduling due to machine disruption to minimize the total weighted completion time pp. 565-578

Wenchang Luo, Taibo Luo, Randy Goebel and Guohui Lin

Volume 21, issue 4, 2018

Two-stage hybrid flowshop scheduling with simultaneous processing machines pp. 387-411

Bailin Wang, Kai Huang and Tieke Li

Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem pp. 413-428

Helga Ingimundardottir and Thomas Philip Runarsson

Online-bounded analysis pp. 429-441

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen and Asaf Levin

Integrated production and outbound distribution scheduling problems with job release dates and deadlines pp. 443-460

Liang-Liang Fu, Mohamed Ali Aloulou and Christian Artigues

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time pp. 461-482

Zhijun Xu and Dehua Xu

Volume 21, issue 3, 2018

A survey on makespan minimization in semi-online environments pp. 269-284

Leah Epstein

An implicit model for multi-activity shift scheduling problems pp. 285-304

Sana Dahmen, Monia Rekik and François Soumis

The triangle scheduling problem pp. 305-312

Christoph Dürr, Zdeněk Hanzálek, Christian Konrad, Yasmina Seddik, René Sitters, Óscar C. Vásquez and Gerhard Woeginger

Improved algorithms for resource allocation under varying capacity pp. 313-325

Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambudha Roy and Yogish Sabharwal

Flexible bandwidth assignment with application to optical networks pp. 327-336

Hadas Shachnai, Ariella Voloshin and Shmuel Zaks

Single machine scheduling with job delivery to multiple customers pp. 337-348

Jianming Dong, Xueshi Wang, Jueliang Hu and Guohui Lin

New strategies for stochastic resource-constrained project scheduling pp. 349-365

Salim Rostami, Stefan Creemers and Roel Leus

Algorithms for a special class of state-dependent shortest path problems with an application to the train routing problem pp. 367-386

Lunce Fu and Maged Dessouky

Volume 21, issue 2, 2018

Preface pp. 129-130

Zdenek Hanzalek, Graham Kendall, Barry McCollum, Premysl Sucha and Greet Vanden Berghe

A list-scheduling heuristic for the short-term planning of assessment centers pp. 131-142

Adrian Zimmermann and Norbert Trautmann

The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster pp. 143-165

Jonas Ingels and Broos Maenhout

Staff assignment with lexicographically ordered acceptance levels pp. 167-189

Tom Rihm and Philipp Baumann

Approaches to modeling train scheduling problems as job-shop problems with blocking constraints pp. 191-207

Julia Lange and Frank Werner

A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines pp. 209-226

Yi Tan, Lars Mönch and John W. Fowler

Exact exponential algorithms for 3-machine flowshop scheduling problems pp. 227-233

Lei Shang, Christophe Lenté, Mathieu Liedloff and Vincent T’Kindt

Family scheduling with batch availability in flow shops to minimize makespan pp. 235-249

Liji Shen and Jatinder N. D. Gupta

Multi-stage resource-aware scheduling for data centers with heterogeneous servers pp. 251-267

Tony T. Tran, Meghana Padmanabhan, Peter Yun Zhang, Heyse Li, Douglas G. Down and J. Christopher Beck

Volume 21, issue 1, 2018

Journal of Scheduling (2018) pp. 1-1

Edmund Burke and Michael Pinedo

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems pp. 3-16

D. Prot and O. Bellenguez-Morineau

Case mix classification and a benchmark set for surgery scheduling pp. 17-33

Gréanne Leeftink and Erwin W. Hans

Energy-efficient scheduling and routing via randomized rounding pp. 35-51

Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli and Maxim Sviridenko

Solving a wind turbine maintenance scheduling problem pp. 53-76

Aurélien Froger, Michel Gendreau, Jorge E. Mendoza, Eric Pinson and Louis-Martin Rousseau

Scheduling shared continuous resources on many-cores pp. 77-92

Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer Heide, Lars Nagel, Sören Riechers, Jiří Sgall and Tim Süß

Task assignment with start time-dependent processing times for personnel at check-in counters pp. 93-109

Emilio Zamorano, Annika Becker and Raik Stolletz

Scheduling electric vehicles and locating charging stations on a path pp. 111-126

Nils Boysen, Dirk Briskorn and Simon Emde

The Current state of bounds on benchmark instances of the job-shop scheduling problem pp. 127-128

Jelke J. Hoorn

Volume 20, issue 6, 2017

Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015) pp. 543-543

Yves Crama, Dries Goossens, Roel Leus, Michaël Schyns and Frits Spieksma

Minimizing worst-case and average-case makespan over scenarios pp. 545-555

Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne Ster, Leen Stougie and Anke Zuylen

Open Shop Scheduling with Synchronization pp. 557-581

C. Weiß, S. Waldherr, S. Knust and N. V. Shakhlevich

Single machine scheduling with a generalized job-dependent cumulative effect pp. 583-592

Kabir Rustogi and Vitaly A. Strusevich

Approximation for scheduling on uniform nonsimultaneous parallel machines pp. 593-600

Liliana Grigoriu and Donald K. Friesen

Online bin stretching with three bins pp. 601-621

Martin Böhm, Jiří Sgall, Rob Stee and Pavel Veselý

Scheduling multipacket frames with frame deadlines pp. 623-634

Łukasz Jeż, Yishay Mansour and Boaz Patt-Shamir

Staff and machine shift scheduling in a German potash mine pp. 635-656

Marco Schulze and Jürgen Zimmermann

LP rounding and combinatorial algorithms for minimizing active and busy time pp. 657-680

Jessica Chang, Samir Khuller and Koyel Mukherjee

Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence pp. 681-693

Azeddine Cheref, Alessandro Agnetis, Christian Artigues and Jean-Charles Billaut

Fault tolerant scheduling of tasks of two sizes under resource augmentation pp. 695-711

Dariusz R. Kowalski, Prudence W. H. Wong and Elli Zavou

Volume 20, issue 5, 2017

Reordering buffer management with advice pp. 423-442

Anna Adamaszek, Marc P. Renault, Adi Rosén and Rob Stee

Online interval scheduling with a bounded number of failures pp. 443-457

Marco Bender, Clemens Thielen and Stephan Westphal

Mathematical models for the berth allocation problem in dry bulk terminals pp. 459-473

Andreas T. Ernst, Ceyda Oğuz, Gaurav Singh and Gita Taherkhani

Finding an optimal Nash equilibrium to the multi-agent project scheduling problem pp. 475-491

Cyril Briand, Sandra Ulrich Ngueveu and Přemysl Šůcha

Scheduling cleaning activities on trains by minimizing idle times pp. 493-506

Enrico Bartolini, Mauro Dell’Amico and Manuel Iori

Crane scheduling in railway yards: an analysis of computational complexity pp. 507-526

Konrad Stephan and Nils Boysen

Offline first-fit decreasing height scheduling of power loads pp. 527-542

Anshu Ranjan, Pramod Khargonekar and Sartaj Sahni

Volume 20, issue 4, 2017

Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs pp. 313-335

Yunqiang Yin, T. C. E. Cheng, Du-Juan Wang and Chin-Chia Wu

Non-preemptive buffer management for latency sensitive packets pp. 337-353

Moran Feldman and Joseph (Seffi) Naor

An exact algorithm for parallel machine scheduling with conflicts pp. 355-372

Daniel Kowalczyk and Roel Leus

An exact extended formulation for the unrelated parallel machine total weighted completion time problem pp. 373-389

Kerem Bülbül and Halil Şen

A neighborhood for complex job shop scheduling problems with regular objectives pp. 391-422

Reinhard Bürgy

Volume 20, issue 3, 2017

Continuous-time production, distribution and financial planning with periodic liquidity balancing pp. 219-237

Wolfgang Albrecht and Martin Steinrücke

The local–global conjecture for scheduling with non-linear cost pp. 239-254

Nikhil Bansal, Christoph Dürr, Nguyen Kim Thang and Óscar C. Vásquez

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack pp. 255-265

René Bevern, Rolf Niedermeier and Ondřej Suchý

Optimal scheduling of contract algorithms with soft deadlines pp. 267-277

Spyros Angelopoulos, Alejandro López-Ortiz and Angèle Hamel

A greedy approximation algorithm for minimum-gap scheduling pp. 279-292

Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li and Seffi Naor

Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence pp. 293-302

Bertrand M. T. Lin, F. J. Hwang and Jatinder N. D. Gupta

The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays pp. 303-311

Aurélien Carlier, Claire Hanen and Alix Munier Kordon

Volume 20, issue 2, 2017

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times pp. 115-127

Leah Epstein and Ido Yatsiv

Scheduling of multi-class multi-server queueing systems with abandonments pp. 129-145

Urtzi Ayesta, Peter Jacko and Vladimír Novák

Improved approaches to the exact solution of the machine covering problem pp. 147-164

Rico Walter, Martin Wirth and Alexander Lawrinenko

A hybrid multi-objective immune algorithm for predictive and reactive scheduling pp. 165-182

Iwona Paprocka and Bożena Skołud

Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations pp. 183-197

Liliana Grigoriu and Dirk Briskorn

Batched bin packing revisited pp. 199-209

Gyorgy Dosa

Unary NP-hardness of minimizing the number of tardy jobs with deadlines pp. 211-218

Jinjiang Yuan

Volume 20, issue 1, 2017

Journal of Scheduling (2017) pp. 1-1

Edmund Burke and Michael Pinedo

Increasing airport capacity utilisation through optimum slot scheduling: review of current developments and identification of future needs pp. 3-24

Konstantinos G. Zografos, Michael A. Madas and Konstantinos N. Androutsopoulos

Scheduling shipments in closed-loop sortation conveyors pp. 25-42

Dirk Briskorn, Simon Emde and Nils Boysen

Optimizing railway crew schedules with fairness preferences pp. 43-55

Silke Jütte, Daniel Müller and Ulrich W. Thonemann

An integrated model for the transshipment yard scheduling problem pp. 57-65

Mateusz Cichenski, Florian Jaehn, Grzegorz Pawlak, Erwin Pesch, Gaurav Singh and Jacek Blazewicz

Real-time management of berth allocation with stochastic arrival and handling times pp. 67-83

Nitish Umang, Michel Bierlaire and Alan L. Erera

Scheduling reclaimers serving a stock pad at a coal terminal pp. 85-101

Thomas Kalinowski, Reena Kapoor and Martin W. P. Savelsbergh

Optimization-based resource allocation for software as a service application in cloud computing pp. 103-113

Chunlin Li, Yun Chang Liu and Xin Yan