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

Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times

Author

Listed:
  • Imène Benkalai
  • Djamal Rebaine
  • Caroline Gagné
  • Pierre Baptiste

Abstract

This paper addresses the problem of scheduling a set of independent jobs with set-up times on a set of machines in a permutation flow shop environment. A metaheuristic known as the Migrating Birds Optimization (MBO) is adapted for the minimization of the makespan. Two versions of the algorithm are presented. The first is a basic MBO and the second introduces additional features. An extensive computational study is conducted to analyse the efficiency of the two methods on a benchmark of instances that can be found in Sistemas de Optimizacion Aplicada (http://soa.iti.es/problem-instances). The second version outperforms by far the first one. Moreover, the results that are produced by the latter show that it is suitable for solving real-world scheduling problems.

Suggested Citation

  • Imène Benkalai & Djamal Rebaine & Caroline Gagné & Pierre Baptiste, 2017. "Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times," International Journal of Production Research, Taylor & Francis Journals, vol. 55(20), pages 6145-6157, October.
    • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:20:p:6145-6157
    DOI: 10.1080/00207543.2017.1327732
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1327732
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1327732?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. Xiuli Wu & Junjian Peng & Xiao Xiao & Shaomin Wu, 2021. "An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading," Journal of Intelligent Manufacturing, Springer, vol. 32(3), pages 707-728, March.
    2. 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.

    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:55:y:2017:i:20:p:6145-6157. 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.