IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p417-43910.1023-a1018927407164.html
   My bibliography  Save this article

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

Author

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

Abstract

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. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • I.G. Drobouchevitch & V.A. Strusevich, 1999. "A heuristic algorithm for two‐machine re‐entrant shop scheduling," Annals of Operations Research, Springer, vol. 86(0), pages 417-439, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:417-439:10.1023/a:1018927407164
    DOI: 10.1023/A:1018927407164
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018927407164
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018927407164?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S-W Choi & Y-D Kim, 2007. "Minimizing makespan on a two-machine re-entrant flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 972-981, July.
    2. Choi, Seong-Woo & Kim, Yeong-Dae, 2009. "Minimizing total tardiness on a two-machine re-entrant flowshop," European Journal of Operational Research, Elsevier, vol. 199(2), pages 375-384, December.
    3. Yang, Dar-Li & Kuo, Wen-Hung & Chern, Maw-Sheng, 2008. "Multi-family scheduling in a two-machine reentrant flow shop with setups," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1160-1170, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:417-439:10.1023/a:1018927407164. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.