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

A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop

Author

Listed:
  • Jingcao Cai
  • Deming Lei
  • Ming Li

Abstract

Hybrid flow shop scheduling problem has been extensively considered in single factory; however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated in multiple factories and should be studied fully with the applications of distributed manufacturing. In this study, DHFSP with sequence-dependent setup times is considered, in which factory assignment and machine assignment of first stage are integrated together. A new shuffled frog-leaping algorithm with memeplex quality (MQSFLA) is proposed to minimise total tardiness and makespan simultaneously. Solution quality of memeplex is measured and new search process is implemented according to solution quality. Evolution quality is evaluated for each memeplex and adopted for dynamically selecting memeplexes in a novel memeplex shuffling. A number of experiments are conducted to test the new strategies and performances of MQSFLA. The computational results demonstrate the effectiveness of the new strategies and the promising advantages of MQSFLA.

Suggested Citation

  • Jingcao Cai & Deming Lei & Ming Li, 2021. "A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop," International Journal of Production Research, Taylor & Francis Journals, vol. 59(18), pages 5404-5421, September.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:18:p:5404-5421
    DOI: 10.1080/00207543.2020.1780333
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1780333
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1780333?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.

    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:59:y:2021:i:18:p:5404-5421. 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.