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

A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan

Author

Listed:
  • Jian-You Xu

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)

  • Win-Chin Lin

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Yu-Wei Chang

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Yu-Hsiang Chung

    (Department of Industrial Engineering Automation Operation Intelligence, Micron Memory Taiwan Co., Ltd., Taichung 42152, Taiwan
    Department of Industrial Engineering and Management, Chin-Yi University of Technology, Taichung 411030, Taiwan)

  • Juin-Han Chen

    (Department of Industrial Engineering and Management, Cheng Shiu University, Kaohsiung City 83347, Taiwan)

  • Chin-Chia Wu

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

Abstract

This paper delves into the scheduling of the two-machine flow-shop problem with step-learning, a scenario in which job processing times decrease if they commence after their learning dates. The objective is to optimize resource allocation and task sequencing to ensure efficient time utilization and timely completion of all jobs, also known as the makespan. The identified problem is established as NP-hard due to its reduction to a single machine for a common learning date. To address this complexity, this paper introduces an initial integer programming model, followed by the development of a branch-and-bound algorithm augmented with two lemmas and a lower bound to attain an exact optimal solution. Additionally, this paper proposes four straightforward heuristics inspired by the Johnson rule, along with their enhanced counterparts. Furthermore, a population-based genetic algorithm is formulated to offer approximate solutions. The performance of all proposed methods is rigorously evaluated through numerical experimental studies.

Suggested Citation

  • Jian-You Xu & Win-Chin Lin & Yu-Wei Chang & Yu-Hsiang Chung & Juin-Han Chen & Chin-Chia Wu, 2023. "A Two-Machine Learning Date Flow-Shop Scheduling Problem with Heuristics and Population-Based GA to Minimize the Makespan," Mathematics, MDPI, vol. 11(19), pages 1-21, September.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:19:p:4060-:d:1247161
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/19/4060/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/19/4060/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ameni Azzouz & Meriem Ennigrou & Lamjed Ben Said, 2018. "Scheduling problems under learning effects: classification and cartography," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1642-1661, February.
    2. Ji-Bo Wang & T. C. Edwin Cheng, 2007. "Scheduling Problems With The Effects Of Deterioration And Learning," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(02), pages 245-261.
    3. Yu-Ping Niu & Long Wan & Ji-Bo Wang, 2015. "A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(02), pages 1-12.
    4. C-C Wu & Y Yin & S-R Cheng, 2013. "Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(1), pages 147-156, January.
    5. Xu, Zhiyong & Sun, Linyan & Gong, Juntao, 2008. "Worst-case analysis for flow shop scheduling with a learning effect," International Journal of Production Economics, Elsevier, vol. 113(2), pages 748-753, June.
    6. Koulamas, Christos & Kyparisis, George J., 2007. "Single-machine and two-machine flowshop scheduling with general learning functions," European Journal of Operational Research, Elsevier, vol. 178(2), pages 402-407, April.
    7. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    8. Ting-Chun Lo & Bertrand M. T. Lin, 2021. "Relocation Scheduling in a Two-Machine Flow Shop with Resource Recycling Operations," Mathematics, MDPI, vol. 9(13), pages 1-35, June.
    9. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
    10. Kuo, Wen-Hung & Yang, Dar-Li, 2006. "Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1184-1190, October.
    11. Kai-biao Sun & Hong-xing Li, 2009. "Some single-machine scheduling problems with actual time and position dependent learning effects," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 161-177, June.
    12. Chia-Lun Hsu & Win-Chin Lin & Lini Duan & Jan-Ray Liao & Chin-Chia Wu & Juin-Han Chen, 2020. "A Robust Two-Machine Flow-Shop Scheduling Model with Scenario-Dependent Processing Times," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-16, June.
    13. Kai-biao Sun & Hong-xing Li, 2009. "Some Single-machine Scheduling Problems with Actual Time and Position Dependent Learning Effects," Fuzzy Information and Engineering, Taylor & Francis Journals, vol. 1(2), pages 161-177, June.
    14. T.C. Cheng & Guoqing Wang, 2000. "Single Machine Scheduling with Learning Effect Considerations," Annals of Operations Research, Springer, vol. 98(1), pages 273-290, December.
    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. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    2. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    3. Kai-biao Sun & Hong-xing Li, 2009. "Some single-machine scheduling problems with actual time and position dependent learning effects," Fuzzy Information and Engineering, Springer, vol. 1(2), pages 161-177, June.
    4. Lai, Peng-Jen & Lee, Wen-Chiung, 2011. "Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects," Omega, Elsevier, vol. 39(5), pages 467-471, October.
    5. Heuser, Patricia & Tauer, Björn, 2023. "Single-machine scheduling with product category-based learning and forgetting effects," Omega, Elsevier, vol. 115(C).
    6. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    7. Xingong Zhang & Guangle Yan & Wanzhen Huang & Guochun Tang, 2011. "Single-machine scheduling problems with time and position dependent processing times," Annals of Operations Research, Springer, vol. 186(1), pages 345-356, June.
    8. Wen-Hung Wu & Yunqiang Yin & T C E Cheng & Win-Chin Lin & Juei-Chao Chen & Shin-Yi Luo & Chin-Chia Wu, 2017. "A combined approach for two-agent scheduling with sum-of-processing-times-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(2), pages 111-120, February.
    9. Jiang, Zhongyi & Chen, Fangfang & Kang, Huiyan, 2013. "Single-machine scheduling problems with actual time-dependent and job-dependent learning effect," European Journal of Operational Research, Elsevier, vol. 227(1), pages 76-80.
    10. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    11. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    12. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2017. "Single-machine scheduling with times-based and job-dependent learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(7), pages 809-815, July.
    13. Lung-Yu Li & Jian-You Xu & Shuenn-Ren Cheng & Xingong Zhang & Win-Chin Lin & Jia-Cheng Lin & Zong-Lin Wu & Chin-Chia Wu, 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment," Mathematics, MDPI, vol. 10(21), pages 1-22, November.
    14. Dar-Li Yang & Wen-Hung Kuo, 2009. "Single-machine scheduling with both deterioration and learning effects," Annals of Operations Research, Springer, vol. 172(1), pages 315-327, November.
    15. Lee, Wen-Chiung & Chung, Yu-Hsiang, 2013. "Permutation flowshop scheduling to minimize the total tardiness with learning effects," International Journal of Production Economics, Elsevier, vol. 141(1), pages 327-334.
    16. J-B Wang, 2010. "Single-machine scheduling with a sum-of-actual-processing-time-based learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 172-177, January.
    17. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    18. Corominas, Albert & Olivella, Jordi & Pastor, Rafael, 2010. "A model for the assignment of a set of tasks when work performance depends on experience of all tasks involved," International Journal of Production Economics, Elsevier, vol. 126(2), pages 335-340, August.
    19. Ercan Şenyiğit & Uğur Atici & Mehmet Burak Şenol, 2022. "Effects of OCRA parameters and learning rate on machine scheduling," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 941-959, September.
    20. Wen-Hung Kuo, 2012. "Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect," Annals of Operations Research, Springer, vol. 196(1), pages 349-359, July.

    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:11:y:2023:i:19:p:4060-:d:1247161. 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.