Content
December 2016, Volume 19, Issue 6
- 729-736 Scheduling on parallel identical machines with late work criterion: Offline and online cases
by Xin Chen & Malgorzata Sterna & Xin Han & Jacek Blazewicz - 737-757 Scheduling with time-dependent discrepancy times
by Florian Jaehn & Helmut A. Sedding - 759-767 On scheduling with non-increasing time slot cost to minimize total weighted completion time
by Yingchao Zhao & Xiangtong Qi & Minming Li
October 2016, Volume 19, Issue 5
- 493-525 Scheduling operating rooms: achievements, challenges and pitfalls
by Michael Samudra & Carla Van Riet & Erik Demeulemeester & Brecht Cardoen & Nancy Vansteenkiste & Frank E. Rademakers - 527-546 Finding optimal tour schedules on transportation paths under extended time window constraints
by Stefan Bock - 547-561 Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
by Peruvemba Sundaram Ravi & Levent Tunçel & Michael Huang
August 2016, Volume 19, Issue 4
- 453-465 Late acceptance hill-climbing for high school timetabling
by George H. G. Fonseca & Haroldo G. Santos & Eduardo G. Carrano - 467-478 Scheduling evacuation operations
by Kaouthar Deghdak & Vincent T’kindt & Jean-Louis Bouquard - 479-492 A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling
by Yuri Bykov & Sanja Petrovic
June 2016, Volume 19, Issue 3
- 213-213 Preface
by Graham Kendall & Greet Vanden Berghe & Barry McCollum
April 2016, Volume 19, Issue 2
- 165-176 Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
by Xin Li & Richard Y. K. Fung - 207-211 A note on longest processing time algorithms for the two uniform parallel machine makespan minimization problem
by Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres
February 2016, Volume 19, Issue 1
- 1-1 Journal of Scheduling (2016)
by Edmund Burke & Michael Pinedo - 3-19 A survey of offline algorithms for energy minimization under deadline constraints
by Marco E. T. Gerards & Johann L. Hurink & Philip K. F. Hölzenspies - 21-31 A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
by Kejun Zhao & Xiwen Lu & Manzhan Gu - 33-42 MP or not MP: that is the question
by Federico Della Croce - 43-60 A genetic algorithm for the robust resource leveling problem
by Hongbo Li & Erik Demeulemeester
Printed from https://ideas.repec.org/s/spr/jsched3.html