Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry

DOI10.1111/ITOR.12104zbMATH Open1338.90347OpenAlexW2129847851MaRDI QIDQ2803270FDOQ2803270

Authors: Rym M'Hallah, Ahlem Bouziri 

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12104

Recommendations

• Cut scheduling in the apparel industry
• A mixed integer programming model for solving a layout problem in the fashion industry
• Optimization of roll cutting in clothing industry
• The cutting stock problem in the canvas industry
• Two-dimensional cutting stock problem with sequence dependent setup times

zbMATH Keywords

simulated annealinggenetic algorithmstwo-dimensional layoutcut schedulingfashion industrygenetic annealingapparel manufacturingcut order planningirregular packing and cuttingmake to order

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• On genetic algorithms for the packing of polygons
• A 2-exchange heuristic for nesting problems
• Mathematical model and efficient algorithms for object packing problem
• A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
• The geometry of nesting problems: a tutorial
• An improved typology of cutting and packing problems
• Fast neighborhood search for two- and three-dimensional nesting problems
• A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
• Tools of mathematical modeling of arbitrary object packing problems
• Generalized hyper-heuristics for solving 2D regular and irregular packing problems
• Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
• Complete and robust no-fit polygon generation for the irregular stock cutting problem
• A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
• A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
• Exhaustive approaches to 2D rectangular perfect packings
• An effective heuristic for the two-dimensional irregular bin packing problem
• Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory
• Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
• An algorithm for polygon placement using a bottom-left strategy
• A tutorial in irregular shape packing problems
• Alternative formulations for a layout problem in the fashion industry
• A mixed integer programming model for solving a layout problem in the fashion industry
• Cut scheduling in the apparel industry
• Solving a cutting problem based on existing patterns
• Two genetic algorithms to solve a layout problem in the fashion industry

Cited In (6)

• Alternative formulations for a layout problem in the fashion industry
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Cut scheduling in the apparel industry
• Title not available (Why is that?)
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
• A mixed integer programming model for solving a layout problem in the fashion industry

Uses Software

• TOPOS

This page was built for publication: Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803270)