IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v21y2021i2d10.1007_s12351-019-00470-8.html
   My bibliography  Save this article

Bi-objective hybrid flow shop scheduling with common due date

Author

Listed:
  • Zhi Li

    (School of Electromechanical Engineering, Guangdong University of Technology
    The University of Hong Kong)

  • Ray Y. Zhong

    (The University of Hong Kong)

  • Ali Vatankhah Barenji

    (School of Electromechanical Engineering, Guangdong University of Technology)

  • J. J. Liu

    (School of Electromechanical Engineering, Guangdong University of Technology)

  • C. X. Yu

    (China University of Petroleum-Beijing)

  • George Q. Huang

    (The University of Hong Kong)

Abstract

In this paper, the problem of hybrid flow shop scheduling with common due dates (HFSCDD) is studied, and the objectives are to minimize the total waiting time and the total earliness/tardiness issues that arise. This study was motivated by a real-life shop floor, with the predefined goal of meeting the requirements of the final product in many manufacturing industries. Where the final product is assembled from multiple components and, the assembly is only initiated when all components of the product are complete in number. These interrelated components have common due dates. In this study, we developed a mathematical model of HFSCDD which made up of “n” jobs that were processed in “m” machines, located on “I” stages by taking into consideration the common due dates. This problem is classified as being NP-hard, and so an efficient modified genetic algorithm is developed to solve it. The proposed modify GA is developed based on the NSGA II method for large sized problems. The results of the proposed algorithm have been compared with PSO and GA algorithms and showed that the proposed algorithm achieved better performance than existing solutions, since the waiting time and the earliness/tardiness are significantly reduced. This is facilitated by the simultaneous production of components for the same product.

Suggested Citation

  • Zhi Li & Ray Y. Zhong & Ali Vatankhah Barenji & J. J. Liu & C. X. Yu & George Q. Huang, 2021. "Bi-objective hybrid flow shop scheduling with common due date," Operational Research, Springer, vol. 21(2), pages 1153-1178, June.
    • Handle: RePEc:spr:operea:v:21:y:2021:i:2:d:10.1007_s12351-019-00470-8
    DOI: 10.1007/s12351-019-00470-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-019-00470-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-019-00470-8?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. 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.
    4. Figielska, Ewa, 2014. "A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages," European Journal of Operational Research, Elsevier, vol. 236(2), pages 433-444.
    5. Hidri, Lotfi, 2016. "Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks," International Journal of Production Economics, Elsevier, vol. 182(C), pages 531-534.
    6. 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.
    7. Grabowski, Jozef & Pempera, Jaroslaw, 2000. "Sequencing of jobs in some production system," European Journal of Operational Research, Elsevier, vol. 125(3), pages 535-550, September.
    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. Liu, Ming & Yang, Xuenan & Chu, Feng & Zhang, Jiantong & Chu, Chengbin, 2020. "Energy-oriented bi-objective optimization for the tempered glass scheduling," Omega, Elsevier, vol. 90(C).
    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. Weiwei Wang & Biao Zhang & Baoxian Jia, 2023. "A Multiobjective Optimization Approach for Multiobjective Hybrid Flowshop Green Scheduling with Consistent Sublots," Sustainability, MDPI, vol. 15(3), pages 1-29, February.
    4. 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.
    5. 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).
    6. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    7. 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.
    8. Lin, Yi-Kuei & Huang, Ding-Hsiang, 2020. "Reliability analysis for a hybrid flow shop with due date consideration," Reliability Engineering and System Safety, Elsevier, vol. 199(C).
    9. 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.
    10. Marco Schulze & Julia Rieck & Cinna Seifi & Jürgen Zimmermann, 2016. "Machine scheduling in underground mining: an application in the potash industry," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 365-403, March.
    11. Fang Wang & Yunqing Rao & Chaoyong Zhang & Qiuhua Tang & Liping Zhang, 2016. "Estimation of Distribution Algorithm for Energy-Efficient Scheduling in Turning Processes," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
    12. 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.
    13. 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.
    14. Chengshuai Li & Biao Zhang & Yuyan Han & Yuting Wang & Junqing Li & Kaizhou Gao, 2022. "Energy-Efficient Hybrid Flowshop Scheduling with Consistent Sublots Using an Improved Cooperative Coevolutionary Algorithm," Mathematics, MDPI, vol. 11(1), pages 1-27, December.
    15. 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.
    16. 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.
    17. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    18. Fei Luan & Zongyan Cai & Shuqiang Wu & Shi Qiang Liu & Yixin He, 2019. "Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    19. Zhengyu Hu & Wenrui Liu & Shengchen Ling & Kuan Fan, 2021. "Research on multi-objective optimal scheduling considering the balance of labor workload distribution," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-15, August.
    20. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(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:spr:operea:v:21:y:2021:i:2:d:10.1007_s12351-019-00470-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.