%0 Journal Article %T A relax-and-fix method for clothes inventory balancing scheduling problem %+ School of Economics and Management %+ Informatique, BioInformatique, Systèmes Complexes (IBISC) %+ School of Economics and Management %+ Shanghai Key Laboratory of Financial Information Technology %A Wang, Shijin %A Zhang, Hanyu %A Chu, Feng %A Yu, Li %< avec comité de lecture %@ 0020-7543 %J International Journal of Production Research %I Taylor & Francis %V 61 %N 20 %P 7085--7104 %8 2023-10 %D 2023 %R 10.1080/00207543.2022.2145517 %K Fast-fashion apparel industry %K Heuristics %K Lateral transshipment %K Mixed integer linear programming %K Relax-and-fix %K Clothes inventory balancing scheduling problem %Z Computer Science [cs]/Operations Research [cs.RO]Journal articles %X 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. %G English %L hal-03873883 %U https://univ-evry.hal.science/hal-03873883 %~ UNIV-EVRY %~ IBISC %~ IBISC-AROBAS %~ UNIV-PARIS-SACLAY %~ UNIV-EVRY-SACLAY %~ UNIVERSITE-PARIS-SACLAY %~ GS-COMPUTER-SCIENCE %~ GS-LIFE-SCIENCES-HEALTH