Journal: J. Scheduling

Volume 19, Issue 4

367 -- 376Abdoul Bitar, Stéphane Dauzère-Pérès, Claude Yugma, Renaud Roussel. A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
377 -- 389Sara Ceschia, Andrea Schaerf. Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays
391 -- 400Philippe Laborie, Jerome Rogerie. Temporal linear relaxation in IBM ILOG CP Optimizer
401 -- 408Nadia Brauner, Gerd Finke, Yakov M. Shafransky, Dzmitry Sledneu. Lawler's minmax cost algorithm: optimality conditions and uncertainty
409 -- 428Patricio Lamas, Erik Demeulemeester. A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
429 -- 452Yi Tan, Torsten Hildebrandt, Bernd Scholz-Reiter. Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem
453 -- 465George H. G. Fonseca, Haroldo G. Santos, Eduardo G. Carrano. Late acceptance hill-climbing for high school timetabling
467 -- 478Kaouthar Deghdak, Vincent T'Kindt, Jean-Louis Bouquard. Scheduling evacuation operations
479 -- 492Yuri Bykov, Sanja Petrovic. A Step Counting Hill Climbing Algorithm applied to University Examination Timetabling