A relax-and-fix method for clothes inventory balancing scheduling problem

Gespeichert in:

Autor*in:	Wang, Shijin [verfasserIn] Zhang, Hanyu [verfasserIn] Chu, Feng [verfasserIn] Yu, Li [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2023

Schlagwörter:	clothes inventory balancing scheduling problem Fast-fashion apparel industry heuristics lateral transshipment mixed integer linear programming relax-and-fix

Übergeordnetes Werk:	Enthalten in: International journal of production research - London [u.a.] : Taylor & Francis, 1996, 61(2023), 20, Seite 7085-7104
Übergeordnetes Werk:	volume:61 ; year:2023 ; number:20 ; pages:7085-7104

Links:	Link aufrufen Link aufrufen

DOI / URN:	10.1080/00207543.2022.2145517

Katalog-ID:	1867243083

Internformat


LEADER	01000caa a2200265 4500
001	1867243083
003	DE-627
005	20240122144346.0
007	cr uuu---uuuuu
008	231023s2023 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1080/00207543.2022.2145517 \|2 doi
035			\|a (DE-627)1867243083
035			\|a (DE-599)KXP1867243083
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
100	1		\|a Wang, Shijin \|e verfasserin \|0 (DE-588)1032262281 \|0 (DE-627)738178497 \|0 (DE-576)379920522 \|4 aut
245	1	2	\|a A relax-and-fix method for clothes inventory balancing scheduling problem \|c Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu
264		1	\|c 2023
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
650		4	\|a clothes inventory balancing scheduling problem \|7 (dpeaa)DE-206
650		4	\|a Fast-fashion apparel industry \|7 (dpeaa)DE-206
650		4	\|a heuristics \|7 (dpeaa)DE-206
650		4	\|a lateral transshipment \|7 (dpeaa)DE-206
650		4	\|a mixed integer linear programming \|7 (dpeaa)DE-206
650		4	\|a relax-and-fix \|7 (dpeaa)DE-206
700	1		\|a Zhang, Hanyu \|e verfasserin \|0 (DE-588)1308226306 \|0 (DE-627)1868929256 \|4 aut
700	1		\|a Chu, Feng \|e verfasserin \|0 (DE-588)139985042 \|0 (DE-627)614386012 \|0 (DE-576)314070125 \|4 aut
700	1		\|a Yu, Li \|e verfasserin \|0 (DE-588)130822690X \|0 (DE-627)1868929493 \|4 aut
773	0	8	\|i Enthalten in \|t International journal of production research \|d London [u.a.] : Taylor & Francis, 1996 \|g 61(2023), 20, Seite 7085-7104 \|h Online-Ressource \|w (DE-627)301516731 \|w (DE-600)1485085-0 \|w (DE-576)094115516 \|x 1366-588X \|7 nnns
773	1	8	\|g volume:61 \|g year:2023 \|g number:20 \|g pages:7085-7104
856	4	0	\|u https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 \|x Verlag \|z lizenzpflichtig
856	4	0	\|u https://doi.org/10.1080/00207543.2022.2145517 \|x Resolving-System \|z lizenzpflichtig
912			\|a GBV_USEFLAG_U
912			\|a GBV_ILN_26
912			\|a ISIL_DE-206
912			\|a SYSFLAG_1
912			\|a GBV_KXP
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_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_110
912			\|a GBV_ILN_120
912			\|a GBV_ILN_152
912			\|a GBV_ILN_224
912			\|a GBV_ILN_285
912			\|a GBV_ILN_370
912			\|a GBV_ILN_647
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2001
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2007
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2010
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_2026
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2065
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2093
912			\|a GBV_ILN_2106
912			\|a GBV_ILN_2108
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2119
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_2232
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2472
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2548
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4246
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 61 \|j 2023 \|e 20 \|h 7085-7104
980			\|2 26 \|1 01 \|x 0206 \|b 4395486940 \|y x1z \|z 23-10-23
982			\|2 26 \|1 00 \|x DE-206 \|b The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.

Indexfelder

author_variant	s w sw h z hz f c fc l y ly
matchkey_str	article:1366588X:2023----::rlxnfxehdocohsnetrblni
hierarchy_sort_str	2023
publishDate	2023
allfields	10.1080/00207543.2022.2145517 doi (DE-627)1867243083 (DE-599)KXP1867243083 DE-627 ger DE-627 rda eng Wang, Shijin verfasserin (DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 aut A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206 Zhang, Hanyu verfasserin (DE-588)1308226306 (DE-627)1868929256 aut Chu, Feng verfasserin (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 aut Yu, Li verfasserin (DE-588)130822690X (DE-627)1868929493 aut Enthalten in International journal of production research London [u.a.] : Taylor & Francis, 1996 61(2023), 20, Seite 7085-7104 Online-Ressource (DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516 1366-588X nnns volume:61 year:2023 number:20 pages:7085-7104 https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 Verlag lizenzpflichtig https://doi.org/10.1080/00207543.2022.2145517 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 61 2023 20 7085-7104 26 01 0206 4395486940 x1z 23-10-23 26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.
spelling	10.1080/00207543.2022.2145517 doi (DE-627)1867243083 (DE-599)KXP1867243083 DE-627 ger DE-627 rda eng Wang, Shijin verfasserin (DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 aut A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206 Zhang, Hanyu verfasserin (DE-588)1308226306 (DE-627)1868929256 aut Chu, Feng verfasserin (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 aut Yu, Li verfasserin (DE-588)130822690X (DE-627)1868929493 aut Enthalten in International journal of production research London [u.a.] : Taylor & Francis, 1996 61(2023), 20, Seite 7085-7104 Online-Ressource (DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516 1366-588X nnns volume:61 year:2023 number:20 pages:7085-7104 https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 Verlag lizenzpflichtig https://doi.org/10.1080/00207543.2022.2145517 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 61 2023 20 7085-7104 26 01 0206 4395486940 x1z 23-10-23 26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.
allfields_unstemmed	10.1080/00207543.2022.2145517 doi (DE-627)1867243083 (DE-599)KXP1867243083 DE-627 ger DE-627 rda eng Wang, Shijin verfasserin (DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 aut A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206 Zhang, Hanyu verfasserin (DE-588)1308226306 (DE-627)1868929256 aut Chu, Feng verfasserin (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 aut Yu, Li verfasserin (DE-588)130822690X (DE-627)1868929493 aut Enthalten in International journal of production research London [u.a.] : Taylor & Francis, 1996 61(2023), 20, Seite 7085-7104 Online-Ressource (DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516 1366-588X nnns volume:61 year:2023 number:20 pages:7085-7104 https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 Verlag lizenzpflichtig https://doi.org/10.1080/00207543.2022.2145517 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 61 2023 20 7085-7104 26 01 0206 4395486940 x1z 23-10-23 26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.
allfieldsGer	10.1080/00207543.2022.2145517 doi (DE-627)1867243083 (DE-599)KXP1867243083 DE-627 ger DE-627 rda eng Wang, Shijin verfasserin (DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 aut A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206 Zhang, Hanyu verfasserin (DE-588)1308226306 (DE-627)1868929256 aut Chu, Feng verfasserin (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 aut Yu, Li verfasserin (DE-588)130822690X (DE-627)1868929493 aut Enthalten in International journal of production research London [u.a.] : Taylor & Francis, 1996 61(2023), 20, Seite 7085-7104 Online-Ressource (DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516 1366-588X nnns volume:61 year:2023 number:20 pages:7085-7104 https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 Verlag lizenzpflichtig https://doi.org/10.1080/00207543.2022.2145517 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 61 2023 20 7085-7104 26 01 0206 4395486940 x1z 23-10-23 26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.
allfieldsSound	10.1080/00207543.2022.2145517 doi (DE-627)1867243083 (DE-599)KXP1867243083 DE-627 ger DE-627 rda eng Wang, Shijin verfasserin (DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 aut A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206 Zhang, Hanyu verfasserin (DE-588)1308226306 (DE-627)1868929256 aut Chu, Feng verfasserin (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 aut Yu, Li verfasserin (DE-588)130822690X (DE-627)1868929493 aut Enthalten in International journal of production research London [u.a.] : Taylor & Francis, 1996 61(2023), 20, Seite 7085-7104 Online-Ressource (DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516 1366-588X nnns volume:61 year:2023 number:20 pages:7085-7104 https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 Verlag lizenzpflichtig https://doi.org/10.1080/00207543.2022.2145517 Resolving-System lizenzpflichtig GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700 AR 61 2023 20 7085-7104 26 01 0206 4395486940 x1z 23-10-23 26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.
language	English
source	Enthalten in International journal of production research 61(2023), 20, Seite 7085-7104 volume:61 year:2023 number:20 pages:7085-7104
sourceStr	Enthalten in International journal of production research 61(2023), 20, Seite 7085-7104 volume:61 year:2023 number:20 pages:7085-7104
format_phy_str_mv	Article
building	26:1
institution	findex.gbv.de
selectbib_iln_str_mv	26@1z
topic_facet	clothes inventory balancing scheduling problem Fast-fashion apparel industry heuristics lateral transshipment mixed integer linear programming relax-and-fix
sw_local_iln_str_mv	26: DE-206:
isfreeaccess_bool	false
container_title	International journal of production research
authorswithroles_txt_mv	Wang, Shijin @@aut@@ Zhang, Hanyu @@aut@@ Chu, Feng @@aut@@ Yu, Li @@aut@@
publishDateDaySort_date	2023-01-01T00:00:00Z
hierarchy_top_id	301516731
id	1867243083
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1867243083</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240122144346.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231023s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207543.2022.2145517</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1867243083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1867243083</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="100" ind1="1" ind2=" "><subfield code="a">Wang, Shijin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1032262281</subfield><subfield code="0">(DE-627)738178497</subfield><subfield code="0">(DE-576)379920522</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A relax-and-fix method for clothes inventory balancing scheduling problem</subfield><subfield code="c">Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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="650" ind1=" " ind2="4"><subfield code="a">clothes inventory balancing scheduling problem</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fast-fashion apparel industry</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">heuristics</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">lateral transshipment</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">mixed integer linear programming</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">relax-and-fix</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hanyu</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1308226306</subfield><subfield code="0">(DE-627)1868929256</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chu, Feng</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)139985042</subfield><subfield code="0">(DE-627)614386012</subfield><subfield code="0">(DE-576)314070125</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, Li</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)130822690X</subfield><subfield code="0">(DE-627)1868929493</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of production research</subfield><subfield code="d">London [u.a.] : Taylor & Francis, 1996</subfield><subfield code="g">61(2023), 20, Seite 7085-7104</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)301516731</subfield><subfield code="w">(DE-600)1485085-0</subfield><subfield code="w">(DE-576)094115516</subfield><subfield code="x">1366-588X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:20</subfield><subfield code="g">pages:7085-7104</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/00207543.2022.2145517</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</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_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_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_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</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_285</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_647</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_2001</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2026</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_2048</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_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</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_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_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</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_2119</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_2232</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_2472</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_2548</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_4046</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_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</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_4322</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_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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">20</subfield><subfield code="h">7085-7104</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4395486940</subfield><subfield code="y">x1z</subfield><subfield code="z">23-10-23</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="b">The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.</subfield></datafield></record></collection>
author	Wang, Shijin
spellingShingle	Wang, Shijin misc clothes inventory balancing scheduling problem misc Fast-fashion apparel industry misc heuristics misc lateral transshipment misc mixed integer linear programming misc relax-and-fix A relax-and-fix method for clothes inventory balancing scheduling problem
authorStr	Wang, Shijin
ppnlink_with_tag_str_mv	@@773@@(DE-627)301516731
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut
typewithnormlink_str_mv	DifferentiatedPerson@(DE-588)1032262281 Person@(DE-588)1032262281 Person@(DE-588)1308226306 DifferentiatedPerson@(DE-588)1308226306 DifferentiatedPerson@(DE-588)139985042 Person@(DE-588)139985042 DifferentiatedPerson@(DE-588)130822690X Person@(DE-588)130822690X
collection	KXP GVK SWB
remote_str	true
last_changed_iln_str_mv	26@23-10-23
illustrated	Not Illustrated
issn	1366-588X
topic_title	26 00 DE-206 The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu clothes inventory balancing scheduling problem (dpeaa)DE-206 Fast-fashion apparel industry (dpeaa)DE-206 heuristics (dpeaa)DE-206 lateral transshipment (dpeaa)DE-206 mixed integer linear programming (dpeaa)DE-206 relax-and-fix (dpeaa)DE-206
topic	misc clothes inventory balancing scheduling problem misc Fast-fashion apparel industry misc heuristics misc lateral transshipment misc mixed integer linear programming misc relax-and-fix
topic_unstemmed	misc clothes inventory balancing scheduling problem misc Fast-fashion apparel industry misc heuristics misc lateral transshipment misc mixed integer linear programming misc relax-and-fix
topic_browse	misc clothes inventory balancing scheduling problem misc Fast-fashion apparel industry misc heuristics misc lateral transshipment misc mixed integer linear programming misc relax-and-fix
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	International journal of production research
normlinkwithtype_str_mv	(DE-588)1032262281@DifferentiatedPerson (DE-588)1032262281@Person (DE-588)1308226306@Person (DE-588)1308226306@DifferentiatedPerson (DE-588)139985042@DifferentiatedPerson (DE-588)139985042@Person (DE-588)130822690X@DifferentiatedPerson (DE-588)130822690X@Person
hierarchy_parent_id	301516731
hierarchy_top_title	International journal of production research
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)301516731 (DE-600)1485085-0 (DE-576)094115516
normlinkwithrole_str_mv	(DE-588)1032262281@@aut@@ (DE-588)1308226306@@aut@@ (DE-588)139985042@@aut@@ (DE-588)130822690X@@aut@@
title	A relax-and-fix method for clothes inventory balancing scheduling problem
ctrlnum	(DE-627)1867243083 (DE-599)KXP1867243083
title_full	A relax-and-fix method for clothes inventory balancing scheduling problem Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu
author_sort	Wang, Shijin
journal	International journal of production research
journalStr	International journal of production research
lang_code	eng
isOA_bool	false
recordtype	marc
publishDateSort	2023
contenttype_str_mv	txt
container_start_page	7085
author_browse	Wang, Shijin Zhang, Hanyu Chu, Feng Yu, Li
selectkey	26:x
container_volume	61
format_se	Elektronische Aufsätze
author-letter	Wang, Shijin
doi_str_mv	10.1080/00207543.2022.2145517
normlink	1032262281 738178497 379920522 1308226306 1868929256 139985042 614386012 314070125 130822690X 1868929493
normlink_prefix_str_mv	(DE-588)1032262281 (DE-627)738178497 (DE-576)379920522 (DE-588)1308226306 (DE-627)1868929256 (DE-588)139985042 (DE-627)614386012 (DE-576)314070125 (DE-588)130822690X (DE-627)1868929493
author2-role	verfasserin
title_sort	relax-and-fix method for clothes inventory balancing scheduling problem
title_auth	A relax-and-fix method for clothes inventory balancing scheduling problem
collection_details	GBV_USEFLAG_U GBV_ILN_26 ISIL_DE-206 SYSFLAG_1 GBV_KXP 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_69 GBV_ILN_70 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_110 GBV_ILN_120 GBV_ILN_152 GBV_ILN_224 GBV_ILN_285 GBV_ILN_370 GBV_ILN_647 GBV_ILN_702 GBV_ILN_2001 GBV_ILN_2003 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2007 GBV_ILN_2009 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2026 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2093 GBV_ILN_2106 GBV_ILN_2108 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2119 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_2232 GBV_ILN_2336 GBV_ILN_2472 GBV_ILN_2507 GBV_ILN_2548 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 GBV_ILN_4700
container_issue	20
title_short	A relax-and-fix method for clothes inventory balancing scheduling problem
url	https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517 https://doi.org/10.1080/00207543.2022.2145517
ausleihindikator_str_mv	26
rolewithnormlink_str_mv	@@aut@@(DE-588)1032262281 @@aut@@(DE-588)1308226306 @@aut@@(DE-588)139985042 @@aut@@(DE-588)130822690X
remote_bool	true
author2	Zhang, Hanyu Chu, Feng Yu, Li
author2Str	Zhang, Hanyu Chu, Feng Yu, Li
ppnlink	301516731
GND_str_mv	Shijin, Wang Wang Shijin Wang, Shijin Zhang Hanyu Hanyu, Zhang Zhang, Hanyu Feng, Chu Chu Feng Chu, Feng Li, Yu Yu Li Yu, Li
GND_txt_mv	Shijin, Wang Wang Shijin Wang, Shijin Zhang Hanyu Hanyu, Zhang Zhang, Hanyu Feng, Chu Chu Feng Chu, Feng Li, Yu Yu Li Yu, Li
GND_txtF_mv	Shijin, Wang Wang Shijin Wang, Shijin Zhang Hanyu Hanyu, Zhang Zhang, Hanyu Feng, Chu Chu Feng Chu, Feng Li, Yu Yu Li Yu, Li
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1080/00207543.2022.2145517
up_date	2024-07-04T07:50:02.397Z
_version_	1803633979450982401
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">1867243083</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240122144346.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231023s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/00207543.2022.2145517</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)1867243083</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1867243083</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="100" ind1="1" ind2=" "><subfield code="a">Wang, Shijin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1032262281</subfield><subfield code="0">(DE-627)738178497</subfield><subfield code="0">(DE-576)379920522</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A relax-and-fix method for clothes inventory balancing scheduling problem</subfield><subfield code="c">Shijin Wang, Hanyu Zhang, Feng Chu, Li Yu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</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="650" ind1=" " ind2="4"><subfield code="a">clothes inventory balancing scheduling problem</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fast-fashion apparel industry</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">heuristics</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">lateral transshipment</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">mixed integer linear programming</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">relax-and-fix</subfield><subfield code="7">(dpeaa)DE-206</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Hanyu</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)1308226306</subfield><subfield code="0">(DE-627)1868929256</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chu, Feng</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)139985042</subfield><subfield code="0">(DE-627)614386012</subfield><subfield code="0">(DE-576)314070125</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yu, Li</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(DE-588)130822690X</subfield><subfield code="0">(DE-627)1868929493</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of production research</subfield><subfield code="d">London [u.a.] : Taylor & Francis, 1996</subfield><subfield code="g">61(2023), 20, Seite 7085-7104</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)301516731</subfield><subfield code="w">(DE-600)1485085-0</subfield><subfield code="w">(DE-576)094115516</subfield><subfield code="x">1366-588X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:61</subfield><subfield code="g">year:2023</subfield><subfield code="g">number:20</subfield><subfield code="g">pages:7085-7104</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tandfonline.com/doi/pdf/10.1080/00207543.2022.2145517</subfield><subfield code="x">Verlag</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1080/00207543.2022.2145517</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">lizenzpflichtig</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ISIL_DE-206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_KXP</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_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_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_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_152</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_285</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_647</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_2001</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_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2007</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2026</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_2048</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_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</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_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_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2093</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2106</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2108</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_2119</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_2232</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_2472</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_2548</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_4046</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_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</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_4322</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_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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">61</subfield><subfield code="j">2023</subfield><subfield code="e">20</subfield><subfield code="h">7085-7104</subfield></datafield><datafield tag="980" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">01</subfield><subfield code="x">0206</subfield><subfield code="b">4395486940</subfield><subfield code="y">x1z</subfield><subfield code="z">23-10-23</subfield></datafield><datafield tag="982" ind1=" " ind2=" "><subfield code="2">26</subfield><subfield code="1">00</subfield><subfield code="x">DE-206</subfield><subfield code="b">The clothes inventory balancing scheduling problem (CIBSP) among branch stores with the allowance of lateral transshipments has gained increasing attentions in fast-fashion apparel industry, especially for the trial sale of new products. To solve the CIBSP faced by a leading apparel company in China, a mixed integer linear programming (MILP) model is first formulated, based on which a relax-and-fix (R&F) method is developed. Several heuristic cuts based on practical experience and observations are further integrated into the R&F method to speed up the searching. The effectiveness of the method is demonstrated through extensive computational experiments: it is able to provide near-optimal solutions with average optimality gap 1.15% with less computation time, compared to solving the MILP model directly in a commercial solver. Case studies also demonstrate that the developed R&F method can obtain high-quality solutions with average optimality gap 0.09% with much less computation time.</subfield></datafield></record></collection>
score	7.4006186

Nicht das Richtige dabei?

Schreiben Sie uns!

A relax-and-fix method for clothes inventory balancing scheduling problem

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?