Annals of Operations Research

, Volume 86, Issue 0, pp 417–439 | Cite as

A heuristic algorithm for two‐machine re‐entrant shop scheduling

  • I.G. Drobouchevitch
  • V.A. Strusevich


This paper considers the problem of sequencing n jobs in a two‐machine re‐entrant shopwith the objective of minimizing the maximum completion time. The shop consists of twomachines, M1 and M2 , and each job has the processing route (M1 , M2 , M1 ). An O(n log n)time heuristic is presented which generates a schedule with length at most 4/3 times that ofan optimal schedule, thereby improving the best previously available worst‐case performanceratio of 3/2.


Completion Time Heuristic Algorithm Optimal Schedule Processing Route Maximum Completion Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B. Chen, C.N. Potts and V.A. Strusevich, Approximation algorithms for two-machine flow shop scheduling with batch setup times, Math. Progr. 82(1998)255-272.Google Scholar
  2. [2]
    B. Chen, C.A. Glass, C.N. Potts and V.A. Strusevich, A new heuristic three-machine flow shop scheduling, Oper. Res. 44(1996)891-898.Google Scholar
  3. [3]
    M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Math. Oper. Res. 1(1976)117-129.Google Scholar
  4. [4]
    T. Gonzalez and S. Sahni, Open shop scheduling to minimize finish time, J. Assoc. Comput. Mach. 23(1976)665-679.Google Scholar
  5. [5]
    T. Gonzalez and S. Sahni, Flowshop and jobshop schedules: complexity and approximation, Oper. Res. 26(1978)36-52.Google Scholar
  6. [6]
    S.M. Johnson, Optimal two-and three-machine production schedules with setup times included, Naval Res. Log. Quart. 1(1954)61-68.Google Scholar
  7. [7]
    D.E. Lane and J.B. Sidney, Batching and scheduling in FMS hubs: Flow time considerations, Oper. Res. 41(1991)1091-1103.Google Scholar
  8. [8]
    V. Lev and I. Adiri, V-shop scheduling, Eur. J. Oper. Res. 18(1984)51-56.Google Scholar
  9. [9]
    E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, eds. S.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, North-Holland, Amsterdam, 1993, pp. 455-522.Google Scholar
  10. [10]
    D.B. Shmoys, C. Stein and J. Wein, Improved approximation algorithms for shop scheduling problems, SIAM J. Comput. 23(1994)617-632.Google Scholar
  11. [11]
    M.Y. Wang, S.P. Sethi and S.L. van de Velde, Minimizing makespan in a class of re-entrant shops, Oper. Res. 45(1997)702-712.Google Scholar
  12. [12]
    D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov and D.B. Shmoys, Short shop schedules, Oper. Res. 45(1997)288-294.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • I.G. Drobouchevitch
  • V.A. Strusevich

There are no affiliations available

Personalised recommendations