IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v5y1959i3p293-298.html
   My bibliography  Save this article

Sequencing n Jobs on Two Machines with Arbitrary Time Lags

Author

Listed:
  • L. G. Mitten

    (Northwestern University)

Abstract

Each of n jobs must be run first on machine I and then on machine I. Running times for each job on each machine are given. Also specified are arbitrary time lags which prescribe that a job may not be started (completed) on machine II until at least a certain time has elapsed since starting (completing) the job on machine I. A rule is given for determining the sequence in which jobs are to be run on the machines--using the same sequence for both machines--in order to minimize the time between the start of production of the first job on machine I and the completion of production of the last job on machine II.

Suggested Citation

  • L. G. Mitten, 1959. "Sequencing n Jobs on Two Machines with Arbitrary Time Lags," Management Science, INFORMS, vol. 5(3), pages 293-298, April.
    • Handle: RePEc:inm:ormnsc:v:5:y:1959:i:3:p:293-298
    DOI: 10.1287/mnsc.5.3.293
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.5.3.293
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.5.3.293?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. Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2020. "Coupled task scheduling with exact delays: Literature review and models," European Journal of Operational Research, Elsevier, vol. 282(1), pages 19-39.
    2. Kim, J-S. & Kang, S-H. & Lee, S. M., 1997. "Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage," Omega, Elsevier, vol. 25(5), pages 547-555, October.
    3. Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
    4. Bart, H. & Kroon, L. G., 1996. "Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions," European Journal of Operational Research, Elsevier, vol. 91(1), pages 144-159, May.
    5. Karim Amrouche & Mourad Boudhar & Mohamed Bendraouche & Farouk Yalaoui, 2017. "Chain-reentrant shop with an exact time lag: new results," International Journal of Production Research, Taylor & Francis Journals, vol. 55(1), pages 285-295, January.
    6. Fondrevelle, J. & Oulamara, A. & Portmann, M.-C., 2008. "Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times," International Journal of Production Economics, Elsevier, vol. 112(1), pages 168-176, March.

    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:ormnsc:v:5:y:1959:i:3:p:293-298. 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.