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 19, issue 6, 2016

New challenges in scheduling theory pp. 617-618

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

Throughput maximization for speed scaling with agreeable deadlines pp. 619-625

Eric Angel, Evripidis Bampis, Vincent Chau and Dimitrios Letsios

Co-scheduling algorithms for high-throughput workload execution pp. 627-640

Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert and Padma Raghavan

Optimizing memory allocation for multistage scheduling including setup times pp. 641-658

Anne Benoit, Mathias Coqblin, Jean-Marc Nicod and Veronika Rehn-Sonigo

Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines pp. 659-685

Peter Brucker and Natalia V. Shakhlevich

Scheduling for electricity cost in a smart grid pp. 687-699

Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W. H. Wong and David K. Y. Yau

Normal-form preemption sequences for an open problem in scheduling theory pp. 701-728

Bo Chen, Ed Coffman, Dariusz Dereniowski and Wiesław Kubiak

Scheduling on parallel identical machines with late work criterion: Offline and online cases pp. 729-736

Xin Chen, Malgorzata Sterna, Xin Han and Jacek Blazewicz

Scheduling with time-dependent discrepancy times pp. 737-757

Florian Jaehn and Helmut A. Sedding

On scheduling with non-increasing time slot cost to minimize total weighted completion time pp. 759-767

Yingchao Zhao, Xiangtong Qi and Minming Li

Volume 19, issue 5, 2016

Scheduling operating rooms: achievements, challenges and pitfalls pp. 493-525

Michael Samudra, Carla Van Riet, Erik Demeulemeester, Brecht Cardoen, Nancy Vansteenkiste and Frank E. Rademakers

Finding optimal tour schedules on transportation paths under extended time window constraints pp. 527-546

Stefan Bock

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime pp. 547-561

Peruvemba Sundaram Ravi, Levent Tunçel and Michael Huang

Volume 19, issue 4, 2016

Late acceptance hill-climbing for high school timetabling pp. 453-465

George H. G. Fonseca, Haroldo G. Santos and Eduardo G. Carrano

Scheduling evacuation operations pp. 467-478

Kaouthar Deghdak, Vincent T’kindt and Jean-Louis Bouquard

A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling pp. 479-492

Yuri Bykov and Sanja Petrovic

Volume 19, issue 3, 2016

Preface pp. 213-213

Graham Kendall, Greet Vanden Berghe and Barry McCollum

Volume 19, issue 2, 2016

Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times pp. 165-176

Xin Li and Richard Y. K. Fung

A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem pp. 207-211

Ivar Massabò, Giuseppe Paletta and Alex J. Ruiz-Torres

Volume 19, issue 1, 2016

Journal of Scheduling (2016) pp. 1-1

Edmund Burke and Michael Pinedo

A survey of offline algorithms for energy minimization under deadline constraints pp. 3-19

Marco E. T. Gerards, Johann L. Hurink and Philip K. F. Hölzenspies

A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines pp. 21-31

Kejun Zhao, Xiwen Lu and Manzhan Gu

MP or not MP: that is the question pp. 33-42

Federico Della Croce

A genetic algorithm for the robust resource leveling problem pp. 43-60

Hongbo Li and Erik Demeulemeester