Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm
作者：
Highlights：
• TDLBP-SDST is handled for the first time in the literature.
• The proposed CP model for the TDLBP obtains the optimal results.
• The MILP models and CP approach are proposed to solve the TDLBP-SDST.
• Effective four metaheuristic approaches are also developed for the TDLBP-SDST.
• TDLBP-SDST aims to minimize mated workstations and workstations, respectively.
摘要
•TDLBP-SDST is handled for the first time in the literature.•The proposed CP model for the TDLBP obtains the optimal results.•The MILP models and CP approach are proposed to solve the TDLBP-SDST.•Effective four metaheuristic approaches are also developed for the TDLBP-SDST.•TDLBP-SDST aims to minimize mated workstations and workstations, respectively.
论文关键词：Two-sided disassembly line,Line balancing,Sequence-dependent setup time,Constraint programming,Metaheuristic algorithms,Mixed-integer linear programming
论文评审过程：Received 18 February 2022, Revised 13 April 2022, Accepted 5 May 2022, Available online 9 May 2022, Version of Record 19 May 2022.
论文官网地址：https://doi.org/10.1016/j.eswa.2022.117529
