Previous Issue
Export Citation(s)Download PDF(s)

Editorials

Editorial

J. Blazewicz,  E. G. Coffman Jr.,  K. Ecker,  G. Finke, 
  • Pages: 427-428
  • First Published: 07 November 2002

Research Articles

Complexity results for parallel machine problems with a single server

Peter Brucker,  Clarisse Dhaenens-Flipo,  Sigrid Knust,  Svetlana A. Kravchenko,  Frank Werner, 
  • Pages: 429-457
  • First Published: 07 November 2002

Scheduling chains on uniform processors with communication delays

Wieslaw Kubiak1,  Bernard Penz,  Denis Trystram, 
  • Pages: 459-476
  • First Published: 07 November 2002

The complexity of two group scheduling problems

Jacek Blazewicz,  Mikhail Y. Kovalyov, 
  • Pages: 477-485
  • First Published: 07 November 2002

A heuristic approach to allocating the continuous resource in discrete–continuous scheduling problems to minimize the makespan

Joanna Józefowska,  Marek Mika,  Rafał Różycki,  Grzegorz Waligóra,  Jan Węglarz, 
  • Pages: 487-499
  • First Published: 07 November 2002

Corrections

Free Access

Vakhania N, Shchepin E. Concurrent operations can be parallized in scheduling multiprocessor job shop. Journal of Scheduling 2002; 5: 227–245

  • Page: 501
  • First Published: 07 November 2002