IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v282y2020i3p835-845.html
   My bibliography  Save this article

Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems

Author

Listed:
  • Alfaro-Fernández, Pedro
  • Ruiz, Rubén
  • Pagnozzi, Federico
  • Stützle, Thomas

Abstract

Industrial production scheduling problems are challenges that researchers have been trying to solve for decades. Many practical scheduling problems such as the hybrid flowshop are NP-hard. As a result, researchers resort to metaheuristics to obtain effective and efficient solutions. The traditional design process of metaheuristics is mainly manual, often metaphor-based, biased by previous experience and prone to producing overly tailored methods that only work well on the tested problems and objectives. In this paper, we use an Automatic Algorithm Design (AAD) methodology to eliminate these limitations. AAD is capable of composing algorithms from components with minimal human intervention. We test the proposed AAD for three different optimization objectives in the hybrid flowshop. Comprehensive computational and statistical testing demonstrates that automatically designed algorithms outperform specifically tailored state-of-the-art methods for the tested objectives in most cases.

Suggested Citation

  • Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
  • Handle: RePEc:eee:ejores:v:282:y:2020:i:3:p:835-845
    DOI: 10.1016/j.ejor.2019.10.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719308203
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2019.10.004?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.

    References listed on IDEAS

    as
    1. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    2. Pan, Quan-Ke & Wang, Ling & Li, Jun-Qing & Duan, Jun-Hua, 2014. "A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation," Omega, Elsevier, vol. 45(C), pages 42-56.
    3. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    4. Helena R. Lourenço & Olivier C. Martin & Thomas Stützle, 2010. "Iterated Local Search: Framework and Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 363-397, Springer.
    5. M.K. Marichelvam & T. Prabaharan & Xin-She Yang & M. Geetha, 2013. "Solving hybrid flow shop scheduling problems using bat algorithm," International Journal of Logistics Economics and Globalisation, Inderscience Enterprises Ltd, vol. 5(1), pages 15-29.
    6. Rajendran, Chandrasekharan & Ziegler, Hans, 1997. "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 103(1), pages 129-138, November.
    7. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    8. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    9. Gupta, Jatinder N.D. & Stafford, Edward Jr., 2006. "Flowshop scheduling research after five decades," European Journal of Operational Research, Elsevier, vol. 169(3), pages 699-711, March.
    10. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Missaoui, Ahmed & Ruiz, Rubén, 2022. "A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows," European Journal of Operational Research, Elsevier, vol. 303(1), pages 99-113.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Pagnozzi, Federico & Stützle, Thomas, 2019. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 409-421.
    2. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    3. Said Aqil & Karam Allali, 2021. "On a bi-criteria flow shop scheduling problem under constraints of blocking and sequence dependent setup time," Annals of Operations Research, Springer, vol. 296(1), pages 615-637, January.
    4. Fernando Luis Rossi & Marcelo Seido Nagano, 2022. "Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(4), pages 1311-1346, December.
    5. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    6. Naderi, Bahman & Ruiz, Rubén, 2014. "A scatter search algorithm for the distributed permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 323-334.
    7. Yong Wang & Yuting Wang & Yuyan Han, 2023. "A Variant Iterated Greedy Algorithm Integrating Multiple Decoding Rules for Hybrid Blocking Flow Shop Scheduling Problem," Mathematics, MDPI, vol. 11(11), pages 1-25, May.
    8. Pagnozzi, Federico & Stützle, Thomas, 2021. "Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems with additional constraints," Operations Research Perspectives, Elsevier, vol. 8(C).
    9. Ruiz, Rubén & Pan, Quan-Ke & Naderi, Bahman, 2019. "Iterated Greedy methods for the distributed permutation flowshop scheduling problem," Omega, Elsevier, vol. 83(C), pages 213-222.
    10. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    11. Mohamadreza Dabiri & Mehdi Yazdani & Bahman Naderi & Hassan Haleh, 2022. "Modeling and solution methods for hybrid flow shop scheduling problem with job rejection," Operational Research, Springer, vol. 22(3), pages 2721-2765, July.
    12. Vallada, Eva & Ruiz, Rubén & Framinan, Jose M., 2015. "New hard benchmark for flowshop scheduling problems minimising makespan," European Journal of Operational Research, Elsevier, vol. 240(3), pages 666-677.
    13. Pablo Valledor & Alberto Gomez & Javier Puente & Isabel Fernandez, 2022. "Solving Rescheduling Problems in Dynamic Permutation Flow Shop Environments with Multiple Objectives Using the Hybrid Dynamic Non-Dominated Sorting Genetic II Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-20, July.
    14. Vallada, Eva & Ruiz, Rubén, 2009. "Cooperative metaheuristics for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 365-376, March.
    15. 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.
    16. Lobo, Fernando G. & Bazargani, Mosab & Burke, Edmund K., 2020. "A cutoff time strategy based on the coupon collector’s problem," European Journal of Operational Research, Elsevier, vol. 286(1), pages 101-114.
    17. Marcelo Seido Nagano & Adriano Seiko Komesu & Hugo Hissashi Miyata, 2019. "An evolutionary clustering search for the total tardiness blocking flow shop problem," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1843-1857, April.
    18. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    19. Pan, Quan-Ke & Ruiz, Rubén, 2012. "Local search methods for the flowshop scheduling problem with flowtime minimization," European Journal of Operational Research, Elsevier, vol. 222(1), pages 31-43.
    20. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.

    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:ejores:v:282:y:2020:i:3:p:835-845. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/locate/eor .

    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.