Journal of Scheduling, Volume 8

Volume 8, Number 1, January 2005

• Edmund K. Burke, Michael Pinedo, Steef L. van de Velde:
  Editorial. 5
  Electronic Edition (link) BibTeX
• Richard J. Wallace, Eugene C. Freuder:
  Supporting dispatchability in schedules with consumable resources. 7-23
  Electronic Edition (link) BibTeX
• George Steiner, Zhihui Xue:
  Scheduling in Reentrant Robotic Cells: Algorithms and Complexity. 25-48
  Electronic Edition (link) BibTeX
• Jaehwan Yang, Marc E. Posner:
  Scheduling Parallel Machines for the Customer Order Problem. 49-74
  Electronic Edition (link) BibTeX
• John W. Fowler, Bosun Kim, W. Matthew Carlyle, Esma Senturk Gel, Shwu-Min Horng:
  Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems. 75-96
  Electronic Edition (link) BibTeX
• Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah:
  Scheduling Web Advertisements: A Note on the Minspace Problem. 97-106
  Electronic Edition (link) BibTeX

Volume 8, Number 2, April 2005

• K. Subramani:
  An Analysis of Totally Clairvoyant Scheduling. 113-133
  Electronic Edition (link) BibTeX
• Paulo Bárcia, J. Orestes Cerdeira:
  The k-Track Assignment Problem on Partial Orders. 135-143
  Electronic Edition (link) BibTeX
• Eugeniusz Nowicki, Czeslaw Smutnicki:
  An Advanced Tabu Search Algorithm for the Job Shop Problem. 145-159
  Electronic Edition (link) BibTeX
• H. A. J. Crauwels, C. N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove:
  Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. 161-177
  Electronic Edition (link) BibTeX
• Foto N. Afrati, Evripidis Bampis, Lucian Finta, Ioannis Milis:
  Scheduling trees with large communication delays on two identical processors. 179-190
  Electronic Edition (link) BibTeX

Volume 8, Number 3, June 2005

• Maciej Drozdowski, Denis Trystram:
  Special Issue on Conference MAPSP 2003: Part I. 195-196
  Electronic Edition (link) BibTeX
• Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
  A Hard Dial-a-Ride Problem that is Easy on Average. 197-210
  Electronic Edition (link) BibTeX
• Ph. Mauguière, Jean-Charles Billaut, Jean-Louis Bouquard:
  New Single Machine and Job-Shop Scheduling Problems with Availability Constraints. 211-231
  Electronic Edition (link) BibTeX
• Natalia V. Shakhlevich, Vitaly A. Strusevich:
  Pre-Emptive Scheduling Problems with Controllable Processing Times. 233-253
  Electronic Edition (link) BibTeX
• Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti:
  Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. 255-273
  Electronic Edition (link) BibTeX

Volume 8, Number 4, July 2005

• Maciej Drozdowski, Denis Trystram:
  Editorial: Special issue on conference MAPSP 2003: Part II. 279-279
  Electronic Edition (link) BibTeX
• Evripidis Bampis, Alexander Kononov:
  Bicriteria approximation algorithms for scheduling problems with communications delays. 281-294
  Electronic Edition (link) BibTeX
• Wieslaw Kubiak:
  Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. 295-302
  Electronic Edition (link) BibTeX
• Peter Brucker, Thomas Kampmeyer:
  Tabu Search Algorithms for Cyclic Machine Scheduling Problems. 303-322
  Electronic Edition (link) BibTeX
• Ceyda Oguz, Muhammet Fikret Ercan:
  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks. 323-351
  Electronic Edition (link) BibTeX

Volume 8, Number 5, October 2005

• Joseph Y.-T. Leung, Haibing Li, Michael Pinedo:
  Order Scheduling in an Environment with Dedicated Resources in Parallel. 355-386
  Electronic Edition (link) BibTeX
• Milind Dawande, H. Neil Geismar, Suresh P. Sethi, Chelliah Sriskandarajah:
  Sequencing and Scheduling in Robotic Cells: Recent Developments. 387-426
  Electronic Edition (link) BibTeX
• Mark Heffernan, Kent D. Wilken:
  Data-Dependency Graph Transformations for Instruction Scheduling. 427-451
  Electronic Edition (link) BibTeX
• Shao Chin Sung, Milan Vlach:
  Maximizing Weighted number of Just-in-Time Jobs on Unrelated Parallel Machines. 453-460
  Electronic Edition (link) BibTeX
• Eric Sanlaville:
  Sensitivity bounds for machine scheduling with uncertain communication delays. 461-473
  Electronic Edition (link) BibTeX

Volume 8, Number 6, December 2005

• K. Bontridder:
  Minimizing Total Weighted Tardiness in a Generalized Job Shop. 479-496
  Electronic Edition (link) BibTeX
• Pasquale Avella, Igor Vasil'ev:
  A Computational Study of a Cutting Plane Algorithm for University Course Timetabling. 497-514
  Electronic Edition (link) BibTeX
• Xiaonan Li, Sigurdur Ólafsson:
  Discovering Dispatching Rules Using Data Mining. 515-527
  Electronic Edition (link) BibTeX
• Pawel Jan Kalczynski, Jerzy Kamburowski:
  Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem. 529-536
  Electronic Edition (link) BibTeX
• J. Yuan, W. P. Shang, Q. Feng:
  A note on the scheduling with two families of jobs. 537-542
  Electronic Edition (link) BibTeX
• Salah E. Elmaghraby:
  Mathematical Programming and Financial Objectives for Scheduling Projects. 543-546
  Electronic Edition (link) BibTeX
• Dirk C. Mattfeld:
  Conference Diary. 547-550
  Electronic Edition (link) BibTeX
• K. Subramani:
  Erratum: An Analysis of Totally Clairvoyant Scheduling. 551-552
  Electronic Edition (link) BibTeX