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

Heuristics in flow shop scheduling with sequence dependent setup times

Author

Listed:
  • Simons, JV

Abstract

This paper addresses the scheduling of jobs with sequence dependent setup times in a deterministic, static flowshop scenario. Four heuristics are described and compared with three benchmarks which represent generally practiced approaches to scheduling in this environment. Performance results are presented for a series of test problems taken from and comparable to those described in previous research. The results indicate that while sophistication does not necessarily lead to performance improvements, two of the proposed heuristics produce substantially better results than the other methods tested and merit consideration for implementation in practice.

Suggested Citation

  • Simons, JV, 1992. "Heuristics in flow shop scheduling with sequence dependent setup times," Omega, Elsevier, vol. 20(2), pages 215-225, March.
    • Handle: RePEc:eee:jomega:v:20:y:1992:i:2:p:215-225
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(92)90075-I
    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. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2005. "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics," European Journal of Operational Research, Elsevier, vol. 165(1), pages 34-54, August.
    2. Dodin, Bajis & Elimam, A. A., 1997. "Audit scheduling with overlapping activities and sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 97(1), pages 22-33, February.
    3. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    4. Ciavotta, Michele & Minella, Gerardo & Ruiz, Rubén, 2013. "Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study," European Journal of Operational Research, Elsevier, vol. 227(2), pages 301-313.
    5. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Research Memorandum FEW 579, Tilburg University, School of Economics and Management.
    6. 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.
    7. Yunhe Wang & Xiangtao Li & Zhiqiang Ma, 2017. "A Hybrid Local Search Algorithm for the Sequence Dependent Setup Times Flowshop Scheduling Problem with Makespan Criterion," Sustainability, MDPI, vol. 9(12), pages 1-35, December.
    8. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Other publications TiSEM 0cf065b7-4836-4cdd-9317-0, Tilburg University, School of Economics and Management.
    9. Roger Z. Ríos-Mercado & Jonathan F. Bard, 2003. "The Flow Shop Scheduling Polyhedron with Setup Times," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 291-318, September.
    10. Ruiz, Ruben & Stutzle, Thomas, 2008. "An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1143-1159, June.
    11. 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.
    12. 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.

    More about this item

    Keywords

    flow shop scheduling heuristics;

    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:eee:jomega:v:20:y:1992:i:2:p:215-225. 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.