Journal of Scheduling, Volume 9

Volume 9, Number 1, February 2006

• Edmund K. Burke, Michael Pinedo, Steef L. van de Velde:
  Editorial. 5
  Electronic Edition (link) BibTeX
• Christopher Geiger, Reha Uzsoy, Haldun Aytug:
  Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach. 7-34
  Electronic Edition (link) BibTeX
• Chung-Yee Lee, Joseph Y.-T. Leung, Gang Yu:
  Two Machine Scheduling under Disruptions with Transportation Considerations. 35-48
  Electronic Edition (link) BibTeX
• Cees Duin, E. Van Der Sluis:
  On the Complexity of Adjacent Resource Scheduling. 49-62
  Electronic Edition (link) BibTeX
• Edward G. Coffman Jr., George S. Lueker:
  Approximation Algorithms for Extensible Bin Packing. 63-69
  Electronic Edition (link) BibTeX
• Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski:
  A Note on Scheduling Equal-Length Jobs to Maximize Throughput. 71-73
  Electronic Edition (link) BibTeX
• Agachai Sumalee:
  Advanced Modeling for Transit Operations and Service Planning. 75-77
  Electronic Edition (link) BibTeX

Volume 9, Number 2, April 2006

• Sanja Petrovic:
  Editorial. 95-96
  Electronic Edition (link) BibTeX
• Hassan Ghaziri, Ibrahim H. Osman:
  Self-organizing feature maps for the vehicle routing problem with backhauls. 97-114
  Electronic Edition (link) BibTeX
• Edmund K. Burke, Sanja Petrovic, Rong Qu:
  Case-based heuristic selection for timetabling problems. 115-132
  Electronic Edition (link) BibTeX
• Rema Padman, Dan Zhu:
  Knowledge integration using problem spaces: A study in resource-constrained project scheduling. 133-152
  Electronic Edition (link) BibTeX
• Andreas Drexl, Alf Kimms, Lars Matthießen:
  Algorithms for the car sequencing and the level scheduling problem. 153-176
  Electronic Edition (link) BibTeX
• Aris Anagnostopoulos, Laurent Michel, Pascal Van Hentenryck, Yannis Vergados:
  A simulated annealing approach to the traveling tournament problem. 177-193
  Electronic Edition (link) BibTeX

Volume 9, Number 3, June 2006

• Jonathan Bard, Cynthia Barnhart:
  Editorial. 199-201
  Electronic Edition (link) BibTeX
• Milind A. Sohoni, Ellis Johnson, T. Glenn Bailey:
  Operational airline reserve crew planning. 203-221
  Electronic Edition (link) BibTeX
• Lucio Bianco, Paolo Dell'Olmo, Stefano Giordani:
  Scheduling models for air traffic control in terminal areas. 223-253
  Electronic Edition (link) BibTeX
• Rüdiger Nissen, Knut Haase:
  Duty-period-based network model for crew rescheduling in European airlines. 255-278
  Electronic Edition (link) BibTeX
• Stephane Bratu, Cynthia Barnhart:
  Flight operations recovery: New approaches considering passenger recovery. 279-298
  Electronic Edition (link) BibTeX
• Bo Chen, Yinyu Ye, Jiawei Zhang:
  Lot-sizing scheduling with batch setup times. 299-310
  Electronic Edition (link) BibTeX

Volume 9, Number 4, August 2006

• Jonathan F. Bard, Lin Wan:
  The task assignment problem for unrestricted movement between workstation groups. 315-341
  Electronic Edition (link) BibTeX
• Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
  An O(n²) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. 343-364
  Electronic Edition (link) BibTeX
• Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
  Minimizing migrations in fair multiprocessor scheduling of persistent tasks. 365-379
  Electronic Edition (link) BibTeX
• George Steiner, Zhihui Xue:
  On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. 381-387
  Electronic Edition (link) BibTeX
• Thomas Roemer:
  A note on the complexity of the concurrent open shop problem. 389-396
  Electronic Edition (link) BibTeX
• Conference Diary. 397-400
  Electronic Edition (link) BibTeX

Volume 9, Number 5, October 2006

• Marco Chiarandini, Mauro Birattari, Krzysztof Socha, Olivia Rossi-Doria:
  An effective hybrid algorithm for university course timetabling. 403-432
  Electronic Edition (link) BibTeX
• Berit Johannes:
  Scheduling parallel jobs to minimize the makespan. 433-452
  Electronic Edition (link) BibTeX
• Chengbin Chu:
  A faster polynomial algorithm for 2-cyclic robotic scheduling. 453-468
  Electronic Edition (link) BibTeX
• J. Christopher Beck, Patrick Prosser, Evgeny Selensky:
  A case study of mutual routing-scheduling reformulation. 469-491
  Electronic Edition (link) BibTeX
• Isto Aho, Erkki Mäkinen:
  On a parallel machine scheduling problem with precedence constraints. 493-495
  Electronic Edition (link) BibTeX

Volume 9, Number 6, December 2006

• J. J. Yuan, Zhaohui Liu, C. T. Ng, T. C. Edwin Cheng:
  Single machine batch scheduling problem with family setup times and release dates to minimize makespan. 499-513
  Electronic Edition (link) BibTeX
• Andrew Lim, Brian Rodrigues, Caixia Wang:
  Two-machine flow shop problems with a single server. 515-543
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Scheduling search procedures: The wheel of fortune. 545-557
  Electronic Edition (link) BibTeX
• Han Hoogeveen, Linda van Norden, Steef L. van de Velde:
  Lower bounds for minimizing total completion time in a two-machine flow shop. 559-568
  Electronic Edition (link) BibTeX
• Wenhua Li, Maurice Queyranne, Maxim Sviridenko, Jinjiang Yuan:
  Approximation algorithms for shop scheduling problems with minsum objective: A correction. 569-570
  Electronic Edition (link) BibTeX