IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v20y1972i1p24-36.html
   My bibliography  Save this article

Single-Server, Two-Machine Sequencing with Switching Time

Author

Listed:
  • Vinod K. Sahney

    (Wayne State University, Detroit, Michigan)

Abstract

In sequencing problems, one of the major assumptions made is that labor is available to operate each of the machines in the shop. In many real-life situations, this assumption is not realistic; labor usually acts as a limiting resource, together with the machines. In this paper we discuss the sequencing of jobs on two machines in parallel when only a single server is available and a finite switching time is incurred to move the server from one machine to the other, and describe an algorithm to solve this problem.

Suggested Citation

  • Vinod K. Sahney, 1972. "Single-Server, Two-Machine Sequencing with Switching Time," Operations Research, INFORMS, vol. 20(1), pages 24-36, February.
    • Handle: RePEc:inm:oropre:v:20:y:1972:i:1:p:24-36
    DOI: 10.1287/opre.20.1.24
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.20.1.24
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.20.1.24?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
    ---><---

    Citations

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


    Cited by:

    1. Wafaa Labbi & Mourad Boudhar & Ammar Oulamara, 2017. "Scheduling two identical parallel machines with preparation constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1531-1548, March.
    2. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.

    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:inm:oropre:v:20:y:1972:i:1:p:24-36. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.