IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v21y1993i2p229-234.html
   My bibliography  Save this article

Scheduling heuristic for the n-jobm-machine flow shop

Author

Listed:
  • Sarin, S
  • Lefoka, M

Abstract

This paper addresses the problem of scheduling jobs in a flow shop manufacturing environment. A heuristic approach is developed for determining a priority sequence for the jobs with a view to minimizing total time to complete all the jobs. The approach is based on minimizing idle time on the last machine. The procedure is tested computationally and compared with the best known heuristic for flow shop sequencing. The proposed procedure demonstrates superior performance on larger problems, both in terms of quality of the solution and execution speed.

Suggested Citation

  • Sarin, S & Lefoka, M, 1993. "Scheduling heuristic for the n-jobm-machine flow shop," Omega, Elsevier, vol. 21(2), pages 229-234, March.
    • Handle: RePEc:eee:jomega:v:21:y:1993:i:2:p:229-234
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(93)90055-P
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Laha, Dipak & Sarin, Subhash C., 2009. "A heuristic to minimize total flow time in permutation flow shop," Omega, Elsevier, vol. 37(3), pages 734-739, June.
    2. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    3. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    4. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    5. Rios-Mercado, Roger Z. & Bard, Jonathan F., 1998. "Heuristics for the flow line problem with setup costs," European Journal of Operational Research, Elsevier, vol. 110(1), pages 76-98, October.
    6. Rad, Shahriar Farahmand & Ruiz, Rubén & Boroojerdian, Naser, 2009. "New high performing heuristics for minimizing makespan in permutation flowshops," Omega, Elsevier, vol. 37(2), pages 331-345, April.

    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:eee:jomega:v:21:y:1993:i:2:p:229-234. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.