Multi-operation multi-machine scheduling

  • Weizhen Mao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 919)


In the multi-operation scheduling that arises in industrial engineering, each job contains multiple tasks (operations) that require execution in different shops. It is assumed that in each shop there is only one machine to perform the required operations. In this paper, a parallel model of multi-operation scheduling is proposed, in which multiple machines are available in each shop to perform the same type of operations. A multi-machine open-shop scheduling problem is studied in detail.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Coffman, E. G. Jr.: Computer and Job Shop Scheduling Theory. John Wiley and Sons, New York (1976)Google Scholar
  2. 2.
    Garey, M. R., Johnson, D. S.: Computers and Intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)Google Scholar
  3. 3.
    Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23 (1976) 665–679CrossRefMathSciNetGoogle Scholar
  4. 4.
    Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory, S. C. Graves, A. H. G. Rinnooy Kan and P. Zipkin, ed., North-Holland (1990)Google Scholar
  5. 5.
    McNaughton, R.: Scheduling with deadlines and loss function. Management Sci. 6 (1959) 1–12MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Weizhen Mao
    • 1
  1. 1.The College of William and MaryWilliamsburgUSA

Personalised recommendations