IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v322y2023i1d10.1007_s10479-022-04537-2.html
   My bibliography  Save this article

Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups

Author

Listed:
  • Pourya Pourhejazy

    (UiT- The Arctic University of Norway)

  • Chen-Yang Cheng

    (National Taipei University of Technology)

  • Kuo-Ching Ying

    (National Taipei University of Technology)

  • Nguyen Hoai Nam

    (National Taipei University of Technology
    Gudeng Precision Industrial Co., LTD)

Abstract

Integrated scheduling of distributed manufacturing operations has implications for supply chain optimization and requires further investigations to facilitate its application area for various industry settings. This study extends the limited literature of the distributed two-stage production-assembly scheduling problems offering a twofold contribution. First, an original mathematical extension, the Distributed Two-Stage Assembly Flowshop Scheduling Problem with Mixed Setups (DTSAFSP-MS) is investigated to integrate setup time constraints while addressing an overlooked scheduling assumption. Second, a novel extension to the Iterated Greedy algorithm is developed to solve this understudied scheduling problem. An extensive set of test instances is considered to evaluate the effectiveness of the developed solution algorithm comparing it with the current-best-performing algorithm in the literature. Results are supportive of the Meta-Lamarckian-based Iterated Greedy (MIG) as a strong benchmark algorithm for solving DTSAFSP-MS with the statistical tests confirming its meaningfully better performance compared to the state-of-the-art.

Suggested Citation

  • Pourya Pourhejazy & Chen-Yang Cheng & Kuo-Ching Ying & Nguyen Hoai Nam, 2023. "Meta-Lamarckian-based iterated greedy for optimizing distributed two-stage assembly flowshops with mixed setups," Annals of Operations Research, Springer, vol. 322(1), pages 125-146, March.
    • Handle: RePEc:spr:annopr:v:322:y:2023:i:1:d:10.1007_s10479-022-04537-2
    DOI: 10.1007/s10479-022-04537-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04537-2
    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/s10479-022-04537-2?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. Jin Deng & Ling Wang & Sheng-yao Wang & Xiao-long Zheng, 2016. "A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3561-3577, June.
    2. Kai Wang & Yun Huang & Hu Qin, 2016. "A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(1), pages 68-82, January.
    3. Chung-Yee Lee & T. C. E. Cheng & B. M. T. Lin, 1993. "Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem," Management Science, INFORMS, vol. 39(5), pages 616-625, May.
    4. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    5. C. N. Potts & S. V. Sevast'janov & V. A. Strusevich & L. N. Van Wassenhove & C. M. Zwaneveld, 1995. "The Two-Stage Assembly Scheduling Problem: Complexity and Approximation," Operations Research, INFORMS, vol. 43(2), pages 346-355, April.
    6. Manuel Parente & Gonçalo Figueira & Pedro Amorim & Alexandra Marques, 2020. "Production scheduling in the context of Industry 4.0: review and trends," International Journal of Production Research, Taylor & Francis Journals, vol. 58(17), pages 5401-5431, September.
    7. 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.
    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. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.
    3. Park, Moon-Won & Kim, Yeong-Dae, 2000. "A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints," European Journal of Operational Research, Elsevier, vol. 123(3), pages 504-518, June.
    4. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    5. Niloy J. Mukherjee & Subhash C. Sarin & Daniel A. Neira, 2023. "Lot streaming for a two-stage assembly system in the presence of handling costs," Journal of Scheduling, Springer, vol. 26(4), pages 335-351, August.
    6. 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.
    7. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    8. Sung, Chang Sup & Juhn, Jaeho, 2009. "Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint," International Journal of Production Economics, Elsevier, vol. 119(2), pages 392-401, June.
    9. Koulamas, Christos & Kyparisis, George J., 2007. "A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 182(2), pages 945-951, October.
    10. Koulamas, Christos & Kyparisis, George J., 2004. "Concurrent flowshop scheduling to minimize makespan," European Journal of Operational Research, Elsevier, vol. 156(2), pages 524-529, July.
    11. Zikai Zhang & Qiuhua Tang, 2022. "Integrating preventive maintenance to two-stage assembly flow shop scheduling: MILP model, constructive heuristics and meta-heuristics," Flexible Services and Manufacturing Journal, Springer, vol. 34(1), pages 156-203, March.
    12. Hatami, Sara & Ruiz, Rubén & Andrés-Romano, Carlos, 2015. "Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 169(C), pages 76-88.
    13. Kovalyov, M. Y. & Potts, C. N. & Strusevich, V. A., 2004. "Batching decisions for assembly production systems," European Journal of Operational Research, Elsevier, vol. 157(3), pages 620-642, September.
    14. Xiong, Fuli & Xing, Keyi & Wang, Feng, 2015. "Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 240(2), pages 338-354.
    15. Ehsan Teymourian & Vahid Kayvanfar & GH. M. Komaki & Majtaba Khodarahmi, 2016. "An Enhanced Intelligent Water Drops Algorithm for Scheduling of an Agile Manufacturing System," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 239-266, March.
    16. George J. Kyparisis & Christos Koulamas, 2002. "Assembly-Line Scheduling with Concurrent Operations and Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 68-80, February.
    17. Yang, W.-H.Wen-Hua, 2004. "Scheduling two-component products on parallel machines," Omega, Elsevier, vol. 32(5), pages 353-359, October.
    18. Sun, Xi & Morizawa, Kazuko & Nagasawa, Hiroyuki, 2003. "Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 146(3), pages 498-516, May.
    19. Zhi-Long Chen & Nicholas G. Hall, 2007. "Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems," Operations Research, INFORMS, vol. 55(6), pages 1072-1089, December.
    20. Hariri, A. M. A. & Potts, C. N., 1997. "A branch and bound algorithm for the two-stage assembly scheduling problem," European Journal of Operational Research, Elsevier, vol. 103(3), pages 547-556, December.

    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:annopr:v:322:y:2023:i:1:d:10.1007_s10479-022-04537-2. 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.