IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v180y2021icp152-178.html
   My bibliography  Save this article

A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation

Author

Listed:
  • Gheisariha, Elmira
  • Tavana, Madjid
  • Jolai, Fariborz
  • Rabiee, Meysam

Abstract

We propose an enhanced multi-objective harmony search (EMOHS) algorithm and a Gaussian mutation to solve the flexible flow shop scheduling problems with sequence-based setup time, transportation time, and probable rework. A constructive heuristic is used to generate the initial solution, and clustering is applied to improve the solution. The proposed algorithm uses response surface methodology to minimize both maximum completion time and mean tardiness, concurrently. We evaluate the efficacy of the proposed algorithm using computational experiments based on five measures of diversity metric, simultaneous rate of achievement for two objectives, mean ideal distance, quality metric, and coverage. The experimental results demonstrate the effectiveness of the proposed EMOHS compared with the existing algorithms for solving multi-objective problems.

Suggested Citation

  • Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.
    • Handle: RePEc:eee:matcom:v:180:y:2021:i:c:p:152-178
    DOI: 10.1016/j.matcom.2020.08.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847542030286X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2020.08.019?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. Saad, Ihsen & Hammadi, Slim & Benrejeb, Mohamed & Borne, Pierre, 2008. "Choquet integral for criteria aggregation in the flexible job-shop scheduling problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 76(5), pages 447-462.
    2. Luo, Qifang & Yang, Xiao & Zhou, Yongquan, 2019. "Nature-inspired approach: An enhanced moth swarm algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 159(C), pages 57-92.
    3. 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.
    4. Leonard Adler & Nelson Fraiman & Edward Kobacker & Michael Pinedo & Juan Carlos Plotnicoff & Tso Pang Wu, 1993. "BPSS: A Scheduling Support System for the Packaging Industry," Operations Research, INFORMS, vol. 41(4), pages 641-648, August.
    5. F J Hwang & Bertrand M T Lin, 2016. "Two-stage flexible flow shop scheduling subject to fixed job sequences," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(3), pages 506-515, March.
    6. Kurz, Mary E. & Askin, Ronald G., 2004. "Scheduling flexible flow lines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 159(1), pages 66-82, November.
    7. Meena, Rakesh Kumar & Jain, Madhu & Sanga, Sudeep Singh & Assad, Assif, 2019. "Fuzzy modeling and harmony search optimization for machining system with general repair, standby support and vacation," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 858-873.
    8. Yuan, Xiaohui & Yuan, Yanbin & Zhang, Yongchuan, 2002. "A hybrid chaotic genetic algorithm for short-term hydro system scheduling," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 59(4), pages 319-327.
    9. Sioud, A. & Gagné, C., 2018. "Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 264(1), pages 66-73.
    10. Dugardin, Frédéric & Yalaoui, Farouk & Amodeo, Lionel, 2010. "New multi-objective method to solve reentrant hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 22-31, May.
    11. M.K. Marichelvam & M. Geetha, 2016. "Application of novel harmony search algorithm for solving hybrid flow shop scheduling problems to minimise makespan," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 23(4), pages 467-481.
    12. Boris Sokolov & Dmitry Ivanov & Semyon A. Potryasaev, 2016. "Flexible flow shop scheduling for continuous production," International Journal of Service and Computing Oriented Manufacturing, Inderscience Enterprises Ltd, vol. 2(2), pages 189-203.
    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. Neufeld, Janis S. & Schulz, Sven & Buscher, Udo, 2023. "A systematic review of multi-objective hybrid flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 309(1), pages 1-23.

    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. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    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. S. M. Mousavi & I. Mahdavi & J. Rezaeian & M. Zandieh, 2018. "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times," Operational Research, Springer, vol. 18(1), pages 123-158, April.
    4. Mingxing Li & Ray Y. Zhong & Ting Qu & George Q. Huang, 2022. "Spatial–temporal out-of-order execution for advanced planning and scheduling in cyber-physical factories," Journal of Intelligent Manufacturing, Springer, vol. 33(5), pages 1355-1372, June.
    5. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    6. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    7. Tzu-Li Chen & Chen-Yang Cheng & Yi-Han Chou, 2020. "Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming," Annals of Operations Research, Springer, vol. 290(1), pages 813-836, July.
    8. Weng, Wei & Fujimura, Shigeru, 2012. "Control methods for dynamic time-based manufacturing under customized product lead times," European Journal of Operational Research, Elsevier, vol. 218(1), pages 86-96.
    9. Neufeld, Janis S. & Schulz, Sven & Buscher, Udo, 2023. "A systematic review of multi-objective hybrid flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 309(1), pages 1-23.
    10. 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.
    11. Urlings, Thijs & Ruiz, Rubén & Stützle, Thomas, 2010. "Shifting representation search for hybrid flexible flowline problems," European Journal of Operational Research, Elsevier, vol. 207(2), pages 1086-1095, December.
    12. 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.
    13. Wang, Kai & Qin, Hu & Huang, Yun & Luo, Mengwen & Zhou, Lei, 2021. "Surgery scheduling in outpatient procedure centre with re-entrant patient flow and fuzzy service times," Omega, Elsevier, vol. 102(C).
    14. Zhang, Huifeng & Yue, Dong & Xie, Xiangpeng & Dou, Chunxia & Sun, Feng, 2017. "Gradient decent based multi-objective cultural differential evolution for short-term hydrothermal optimal scheduling of economic emission with integrating wind power and photovoltaic power," Energy, Elsevier, vol. 122(C), pages 748-766.
    15. Zhen Song & Håkan Schunnesson & Mikael Rinne & John Sturgul, 2015. "Intelligent Scheduling for Underground Mobile Mining Equipment," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-21, June.
    16. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    17. Shahvari, Omid & Logendran, Rasaratnam, 2016. "Hybrid flow shop batching and scheduling with a bi-criteria objective," International Journal of Production Economics, Elsevier, vol. 179(C), pages 239-258.
    18. Fang-Fang Li & Jia-Hua Wei & Xu-Dong Fu & Xin-Yu Wan, 2012. "An Effective Approach to Long-Term Optimal Operation of Large-Scale Reservoir Systems: Case Study of the Three Gorges System," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 26(14), pages 4073-4090, November.
    19. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    20. Baykasoglu, Adil & ÖzbakIr, Lale, 2010. "Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system," International Journal of Production Economics, Elsevier, vol. 124(2), pages 369-381, April.

    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:matcom:v:180:y:2021:i:c:p:152-178. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.