Three-machine shop scheduling with partially ordered processing routes

  • V A Strusevich
  • I G Drobouchevitch
  • N V Shakhlevich
Theoretical Paper

Abstract

This paper considers the problem of sequencing n jobs in a three-machine shop with the objective of minimising the maximum completion time. The shop consists of three machines, M1,M2 and M_{3}. A job is first processed on M1 and then is assigned either the route (M2,M_{3}) or the route (M_{3},M2). Thus, for our model the processing route is given by a partial order of machines, as opposed to the linear order of machines for a job shop, or to an arbitrary sequence of machines for an open shop. The main result is on O(nlog n) time heuristic, which generates a schedule with the makespan that is at most 5/3 times the optimum value.

Keywords

shop scheduling approximation algorithm worst-case analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Palgrave Macmillan Ltd 2002

Authors and Affiliations

  • V A Strusevich
    • 1
  • I G Drobouchevitch
    • 2
  • N V Shakhlevich
    • 3
  1. 1.University of GreenwichLondonUK
  2. 2.University of OttawaCanada
  3. 3.University of LeedsUK

Personalised recommendations