IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i16p2575-d1460200.html
   My bibliography  Save this article

Co-Evolutionary Algorithm for Two-Stage Hybrid Flow Shop Scheduling Problem with Suspension Shifts

Author

Listed:
  • Zhijie Huang

    (Management Science and Engineering Department, Fuzhou University, Fuzhou 350116, China)

  • Lin Huang

    (Management Science and Engineering Department, Fuzhou University, Fuzhou 350116, China)

  • Debiao Li

    (Management Science and Engineering Department, Fuzhou University, Fuzhou 350116, China)

Abstract

Demand fluctuates in actual production. When manufacturers face demand under their maximum capacity, suspension shifts are crucial for cost reduction and on-time delivery. In this case, suspension shifts are needed to minimize idle time and prevent inventory buildup. Thus, it is essential to integrate suspension shifts with scheduling under an uncertain production environment. This paper addresses the two-stage hybrid flow shop scheduling problem (THFSP) with suspension shifts under uncertain processing times, aiming to minimize the weighted sum of earliness and tardiness. We develop a stochastic integer programming model and validate it using the Gurobi solver. Additionally, we propose a dual-space co-evolutionary biased random key genetic algorithm (DCE-BRKGA) with parallel evolution of solutions and scenarios. Considering decision-makers’ risk preferences, we use both average and pessimistic criteria for fitness evaluation, generating two types of solutions and scenario populations. Testing with 28 datasets, we use the value of the stochastic solution (VSS) and the expected value of perfect information (EVPI) to quantify benefits. Compared to the average scenario, the VSS shows that the proposed algorithm achieves additional value gains of 0.9% to 69.9%. Furthermore, the EVPI indicates that after eliminating uncertainty, the algorithm yields potential improvements of 2.4% to 20.3%. These findings indicate that DCE-BRKGA effectively supports varying decision-making risk preferences, providing robust solutions even without known processing time distributions.

Suggested Citation

  • Zhijie Huang & Lin Huang & Debiao Li, 2024. "Co-Evolutionary Algorithm for Two-Stage Hybrid Flow Shop Scheduling Problem with Suspension Shifts," Mathematics, MDPI, vol. 12(16), pages 1-30, August.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:16:p:2575-:d:1460200
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/16/2575/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/16/2575/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yu, Tae-Sun & Han, Jun-Hee, 2021. "Scheduling proportionate flow shops with preventive machine maintenance," International Journal of Production Economics, Elsevier, vol. 231(C).
    2. Lin, Ran & Wang, Jun-Qiang & Oulamara, Ammar, 2023. "Online scheduling on parallel-batch machines with periodic availability constraints and job delivery," Omega, Elsevier, vol. 116(C).
    3. Oliveira, Beatriz B. & Carravilla, Maria Antónia & Oliveira, José F. & Costa, Alysson M., 2019. "A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem," European Journal of Operational Research, Elsevier, vol. 276(2), pages 637-655.
    4. Liu, Yu & Zhang, Qin & Ouyang, Zhiyuan & Huang, Hong-Zhong, 2021. "Integrated production planning and preventive maintenance scheduling for synchronized parallel machines," Reliability Engineering and System Safety, Elsevier, vol. 215(C).
    5. Xin Liu & Feng Chu & Feifeng Zheng & Chengbin Chu & Ming Liu, 2021. "Parallel machine scheduling with stochastic release times and processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 59(20), pages 6327-6346, October.
    6. Melissa Shahgholi Zadeh & Yalda Katebi & Ali Doniavi, 2019. "A heuristic model for dynamic flexible job shop scheduling problem considering variable processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3020-3035, May.
    7. Lee, C. -Y. & Leon, V. J., 2001. "Machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 128(1), pages 119-128, January.
    Full references (including those not matched with items on IDEAS)

    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. Liagkouras, Konstantinos & Metaxiotis, Konstantinos, 2021. "Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1019-1036.
    2. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    3. Lodree Jr., Emmett J. & Geiger, Christopher D., 2010. "A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration," European Journal of Operational Research, Elsevier, vol. 201(2), pages 644-648, March.
    4. Jiang, Junwei & An, Youjun & Dong, Yuanfa & Hu, Jiawen & Li, Yinghe & Zhao, Ziye, 2023. "Integrated optimization of non-permutation flow shop scheduling and maintenance planning with variable processing speed," Reliability Engineering and System Safety, Elsevier, vol. 234(C).
    5. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    6. Zhu, Mixin & Zhou, Xiaojun, 2023. "Hierarchical-clustering-based joint optimization of spare part provision and maintenance scheduling for serial-parallel multi-station manufacturing systems," International Journal of Production Economics, Elsevier, vol. 264(C).
    7. Phosavanh, Johnson & Oron, Daniel, 2024. "Two-agent single-machine scheduling with a rate-modifying activity," European Journal of Operational Research, Elsevier, vol. 312(3), pages 866-876.
    8. Nasini, Stefano & Nessah, Rabia, 2022. "A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications," International Journal of Production Economics, Elsevier, vol. 251(C).
    9. Fan, Shu-Kai S. & Chiu, Shang-Hao, 2024. "A new ViT-Based augmentation framework for wafer map defect classification to enhance the resilience of semiconductor supply chains," International Journal of Production Economics, Elsevier, vol. 273(C).
    10. Boumallessa, Zeineb & Chouikhi, Houssam & Elleuch, Mounir & Bentaher, Hatem, 2023. "Modeling and optimizing the maintenance schedule using dynamic quality and machine condition monitors in an unreliable single production system," Reliability Engineering and System Safety, Elsevier, vol. 235(C).
    11. An, Youjun & Chen, Xiaohui & Hu, Jiawen & Zhang, Lin & Li, Yinghe & Jiang, Junwei, 2022. "Joint optimization of preventive maintenance and production rescheduling with new machine insertion and processing speed selection," Reliability Engineering and System Safety, Elsevier, vol. 220(C).
    12. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    13. Lin, Ran & Wang, Jun-Qiang & Liu, Zhixin & Xu, Jun, 2023. "Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions," European Journal of Operational Research, Elsevier, vol. 309(1), pages 53-64.
    14. Yong He & Min Ji & T. C. E. Cheng, 2005. "Single machine scheduling with a restricted rate‐modifying activity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 361-369, June.
    15. Xinyu Sun & Tao Liu & Xin-Na Geng & Yang Hu & Jing-Xiao Xu, 2023. "Optimization of scheduling problems with deterioration effects and an optional maintenance activity," Journal of Scheduling, Springer, vol. 26(3), pages 251-266, June.
    16. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    17. Tugba Saraç & Feristah Ozcelik & Mehmet Ertem, 2023. "Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times," Operational Research, Springer, vol. 23(3), pages 1-19, September.
    18. Feifeng Zheng & Kezheng Chen & Ming Liu, 2023. "Optimization of Communication Base Station Battery Configuration Considering Demand Transfer and Sleep Mechanism under Uncertain Interruption Duration," Sustainability, MDPI, vol. 15(24), pages 1-18, December.
    19. Sun, Yige & Chung, Sai-Ho & Wen, Xin & Ma, Hoi-Lam, 2021. "Novel robotic job-shop scheduling models with deadlock and robot movement considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    20. An, Xiangxin & Si, Guojin & Xia, Tangbin & Wang, Dong & Pan, Ershun & Xi, Lifeng, 2023. "An energy-efficient collaborative strategy of maintenance planning and production scheduling for serial-parallel systems under time-of-use tariffs," Applied Energy, Elsevier, vol. 336(C).

    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:gam:jmathe:v:12:y:2024:i:16:p:2575-:d:1460200. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.