Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem
The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent ye...
Ausführliche Beschreibung
Autor*in: |
Zhu, Xuedong [verfasserIn] Son, Junbo [verfasserIn] Zhang, Xi [verfasserIn] Wu, Jianguo [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2022 |
---|
Schlagwörter: |
Integrated process planning and scheduling |
---|
Übergeordnetes Werk: |
Enthalten in: Omega - Oxford [u.a.] : Elsevier, 1973, 117 |
---|---|
Übergeordnetes Werk: |
volume:117 |
DOI / URN: |
10.1016/j.omega.2022.102823 |
---|
Katalog-ID: |
ELV064796361 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | ELV064796361 | ||
003 | DE-627 | ||
005 | 20230926130843.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230926s2022 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.omega.2022.102823 |2 doi | |
035 | |a (DE-627)ELV064796361 | ||
035 | |a (ELSEVIER)S0305-0483(22)00229-8 | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 650 |q VZ |
084 | |a 85.06 |2 bkl | ||
100 | 1 | |a Zhu, Xuedong |e verfasserin |4 aut | |
245 | 1 | 0 | |a Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
264 | 1 | |c 2022 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. | ||
650 | 4 | |a Integrated process planning and scheduling | |
650 | 4 | |a Constraint programming | |
650 | 4 | |a Logic-based Benders decomposition | |
650 | 4 | |a Forbidden intervals | |
700 | 1 | |a Son, Junbo |e verfasserin |4 aut | |
700 | 1 | |a Zhang, Xi |e verfasserin |4 aut | |
700 | 1 | |a Wu, Jianguo |e verfasserin |0 (orcid)0000-0002-2885-8725 |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Omega |d Oxford [u.a.] : Elsevier, 1973 |g 117 |h Online-Ressource |w (DE-627)302466169 |w (DE-600)1491111-5 |w (DE-576)079719333 |x 1873-5274 |7 nnns |
773 | 1 | 8 | |g volume:117 |
912 | |a GBV_USEFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
936 | b | k | |a 85.06 |j Unternehmensführung |q VZ |
951 | |a AR | ||
952 | |d 117 |
author_variant |
x z xz j s js x z xz j w jw |
---|---|
matchkey_str |
article:18735274:2022----::osritrgamnadoibsdedrdcmoiinotenertdrcsp |
hierarchy_sort_str |
2022 |
bklnumber |
85.06 |
publishDate |
2022 |
allfields |
10.1016/j.omega.2022.102823 doi (DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 DE-627 ger DE-627 rda eng 650 VZ 85.06 bkl Zhu, Xuedong verfasserin aut Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem 2022 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals Son, Junbo verfasserin aut Zhang, Xi verfasserin aut Wu, Jianguo verfasserin (orcid)0000-0002-2885-8725 aut Enthalten in Omega Oxford [u.a.] : Elsevier, 1973 117 Online-Ressource (DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 1873-5274 nnns volume:117 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.06 Unternehmensführung VZ AR 117 |
spelling |
10.1016/j.omega.2022.102823 doi (DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 DE-627 ger DE-627 rda eng 650 VZ 85.06 bkl Zhu, Xuedong verfasserin aut Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem 2022 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals Son, Junbo verfasserin aut Zhang, Xi verfasserin aut Wu, Jianguo verfasserin (orcid)0000-0002-2885-8725 aut Enthalten in Omega Oxford [u.a.] : Elsevier, 1973 117 Online-Ressource (DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 1873-5274 nnns volume:117 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.06 Unternehmensführung VZ AR 117 |
allfields_unstemmed |
10.1016/j.omega.2022.102823 doi (DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 DE-627 ger DE-627 rda eng 650 VZ 85.06 bkl Zhu, Xuedong verfasserin aut Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem 2022 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals Son, Junbo verfasserin aut Zhang, Xi verfasserin aut Wu, Jianguo verfasserin (orcid)0000-0002-2885-8725 aut Enthalten in Omega Oxford [u.a.] : Elsevier, 1973 117 Online-Ressource (DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 1873-5274 nnns volume:117 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.06 Unternehmensführung VZ AR 117 |
allfieldsGer |
10.1016/j.omega.2022.102823 doi (DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 DE-627 ger DE-627 rda eng 650 VZ 85.06 bkl Zhu, Xuedong verfasserin aut Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem 2022 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals Son, Junbo verfasserin aut Zhang, Xi verfasserin aut Wu, Jianguo verfasserin (orcid)0000-0002-2885-8725 aut Enthalten in Omega Oxford [u.a.] : Elsevier, 1973 117 Online-Ressource (DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 1873-5274 nnns volume:117 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.06 Unternehmensführung VZ AR 117 |
allfieldsSound |
10.1016/j.omega.2022.102823 doi (DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 DE-627 ger DE-627 rda eng 650 VZ 85.06 bkl Zhu, Xuedong verfasserin aut Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem 2022 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals Son, Junbo verfasserin aut Zhang, Xi verfasserin aut Wu, Jianguo verfasserin (orcid)0000-0002-2885-8725 aut Enthalten in Omega Oxford [u.a.] : Elsevier, 1973 117 Online-Ressource (DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 1873-5274 nnns volume:117 GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 85.06 Unternehmensführung VZ AR 117 |
language |
English |
source |
Enthalten in Omega 117 volume:117 |
sourceStr |
Enthalten in Omega 117 volume:117 |
format_phy_str_mv |
Article |
bklname |
Unternehmensführung |
institution |
findex.gbv.de |
topic_facet |
Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals |
dewey-raw |
650 |
isfreeaccess_bool |
false |
container_title |
Omega |
authorswithroles_txt_mv |
Zhu, Xuedong @@aut@@ Son, Junbo @@aut@@ Zhang, Xi @@aut@@ Wu, Jianguo @@aut@@ |
publishDateDaySort_date |
2022-01-01T00:00:00Z |
hierarchy_top_id |
302466169 |
dewey-sort |
3650 |
id |
ELV064796361 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV064796361</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230926130843.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230926s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.omega.2022.102823</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV064796361</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0305-0483(22)00229-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.06</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhu, Xuedong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integrated process planning and scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic-based Benders decomposition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Forbidden intervals</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Son, Junbo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Xi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Jianguo</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2885-8725</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Omega</subfield><subfield code="d">Oxford [u.a.] : Elsevier, 1973</subfield><subfield code="g">117</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)302466169</subfield><subfield code="w">(DE-600)1491111-5</subfield><subfield code="w">(DE-576)079719333</subfield><subfield code="x">1873-5274</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:117</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.06</subfield><subfield code="j">Unternehmensführung</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">117</subfield></datafield></record></collection>
|
author |
Zhu, Xuedong |
spellingShingle |
Zhu, Xuedong ddc 650 bkl 85.06 misc Integrated process planning and scheduling misc Constraint programming misc Logic-based Benders decomposition misc Forbidden intervals Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
authorStr |
Zhu, Xuedong |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)302466169 |
format |
electronic Article |
dewey-ones |
650 - Management & auxiliary services |
delete_txt_mv |
keep |
author_role |
aut aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
issn |
1873-5274 |
topic_title |
650 VZ 85.06 bkl Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem Integrated process planning and scheduling Constraint programming Logic-based Benders decomposition Forbidden intervals |
topic |
ddc 650 bkl 85.06 misc Integrated process planning and scheduling misc Constraint programming misc Logic-based Benders decomposition misc Forbidden intervals |
topic_unstemmed |
ddc 650 bkl 85.06 misc Integrated process planning and scheduling misc Constraint programming misc Logic-based Benders decomposition misc Forbidden intervals |
topic_browse |
ddc 650 bkl 85.06 misc Integrated process planning and scheduling misc Constraint programming misc Logic-based Benders decomposition misc Forbidden intervals |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Omega |
hierarchy_parent_id |
302466169 |
dewey-tens |
650 - Management & public relations |
hierarchy_top_title |
Omega |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)302466169 (DE-600)1491111-5 (DE-576)079719333 |
title |
Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
ctrlnum |
(DE-627)ELV064796361 (ELSEVIER)S0305-0483(22)00229-8 |
title_full |
Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
author_sort |
Zhu, Xuedong |
journal |
Omega |
journalStr |
Omega |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology |
recordtype |
marc |
publishDateSort |
2022 |
contenttype_str_mv |
zzz |
author_browse |
Zhu, Xuedong Son, Junbo Zhang, Xi Wu, Jianguo |
container_volume |
117 |
class |
650 VZ 85.06 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
Zhu, Xuedong |
doi_str_mv |
10.1016/j.omega.2022.102823 |
normlink |
(ORCID)0000-0002-2885-8725 |
normlink_prefix_str_mv |
(orcid)0000-0002-2885-8725 |
dewey-full |
650 |
author2-role |
verfasserin |
title_sort |
constraint programming and logic-based benders decomposition for the integrated process planning and scheduling problem |
title_auth |
Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
abstract |
The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. |
abstractGer |
The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. |
abstract_unstemmed |
The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. |
collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 |
title_short |
Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem |
remote_bool |
true |
author2 |
Son, Junbo Zhang, Xi Wu, Jianguo |
author2Str |
Son, Junbo Zhang, Xi Wu, Jianguo |
ppnlink |
302466169 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.omega.2022.102823 |
up_date |
2024-07-06T20:47:08.732Z |
_version_ |
1803864064637534208 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">ELV064796361</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230926130843.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230926s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.omega.2022.102823</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV064796361</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0305-0483(22)00229-8</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">650</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">85.06</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhu, Xuedong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving desirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, several approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS problem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Integrated process planning and scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic-based Benders decomposition</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Forbidden intervals</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Son, Junbo</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Xi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Jianguo</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2885-8725</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Omega</subfield><subfield code="d">Oxford [u.a.] : Elsevier, 1973</subfield><subfield code="g">117</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)302466169</subfield><subfield code="w">(DE-600)1491111-5</subfield><subfield code="w">(DE-576)079719333</subfield><subfield code="x">1873-5274</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:117</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">85.06</subfield><subfield code="j">Unternehmensführung</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">117</subfield></datafield></record></collection>
|
score |
7.3986235 |