IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i9p2853-2870.html
   My bibliography  Save this article

A particle swarm optimisation for the no-wait flow shop problem with due date constraints

Author

Listed:
  • Hamed Samarghandi

Abstract

This paper considers the no-wait flow shop scheduling problem with due date constraints. In the no-wait flow shop problem, waiting time is not allowed between successive operations of jobs. Moreover, a due date is associated with the completion of each job. The considered objective function is makespan. This problem is proved to be strongly NP-Hard. In this paper, a particle swarm optimisation (PSO) is developed to deal with the problem. Moreover, the effect of some dispatching rules for generating initial solutions are studied. A Taguchi-based design of experience approach has been followed to determine the effect of the different values of the parameters on the performance of the algorithm. To evaluate the performance of the proposed PSO, a large number of benchmark problems are selected from the literature and solved with different due date and penalty settings. Computational results confirm that the proposed PSO is efficient and competitive; the developed framework is able to improve many of the best-known solutions of the test problems available in the literature.

Suggested Citation

  • Hamed Samarghandi, 2015. "A particle swarm optimisation for the no-wait flow shop problem with due date constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 53(9), pages 2853-2870, May.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:9:p:2853-2870
    DOI: 10.1080/00207543.2015.1007245
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1007245
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1007245?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. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    2. Xuemei Qi & Hongtao Wang & Haihong Zhu & Ji Zhang & Fulong Chen & Jie Yang, 2016. "Fast local neighborhood search algorithm for the no-wait flow shop scheduling with total flow time minimization," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4957-4972, August.
    3. Wenjie Li & Jinjiang Yuan, 2021. "Single-machine online scheduling of jobs with non-delayed processing constraint," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 830-843, May.

    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:taf:tprsxx:v:53:y:2015:i:9:p:2853-2870. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.