A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry

DOI10.1287/mnsc.44.3.301zbMath0989.90077OpenAlexW2167390364MaRDI QIDQ2783923

Zeger Degraeve, Martina Vandebroek

Publication date: 17 April 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.44.3.301

zbMATH Keywords

mixed integer programmingcutting stock problemlayout problemfashion industry

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50)

Related Items (13)

Alternative configurations for cutting machines in a tube cutting mill ⋮ Cut scheduling in the apparel industry ⋮ Minimizing setups and waste when printing labels of consumer goods ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Two genetic algorithms to solve a layout problem in the fashion industry ⋮ Heuristic algorithm for a cutting stock problem in the steel bridge construction ⋮ Layout optimisation for an installation port of an offshore wind farm ⋮ Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Explaining fashion cycles: imitators chasing innovators in product space ⋮ Alternative formulations for a layout problem in the fashion industry ⋮ An improved best-fit heuristic for the orthogonal strip packing problem ⋮ Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

Uses Software

• LINDO

This page was built for publication: A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry