IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v61y2023i20p7085-7104.html
   My bibliography  Save this article

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

Author

Listed:
  • Shijin Wang
  • Hanyu Zhang
  • Feng Chu
  • Li Yu

Abstract

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.

Suggested Citation

  • Shijin Wang & Hanyu Zhang & Feng Chu & Li Yu, 2023. "A relax-and-fix method for clothes inventory balancing scheduling problem," International Journal of Production Research, Taylor & Francis Journals, vol. 61(20), pages 7085-7104, October.
    • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:20:p:7085-7104
    DOI: 10.1080/00207543.2022.2145517
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2022.2145517
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2022.2145517?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:61:y:2023:i:20:p:7085-7104. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.