Optimizing cut order planning: A comparative study of heuristics, metaheuristics, and MILP algorithms
Cut Order Planning (COP) optimizes production costs in the apparel industry by efficiently cutting fabric for garments. This complex process involves challenging decision-making due to order specifications and production constraints. This article introduces novel approaches to the COP problem using...
Saved in:
Main Authors: | Sharif Al-Mahmud, Jose Alejandro Cano, Emiro Antonio Campo, Stephan Weyers |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitat Politècnica de València
2025-01-01
|
Series: | International Journal of Production Management and Engineering |
Subjects: | |
Online Access: | https://polipapers.upv.es/index.php/IJPME/article/view/22196 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The analysis of algorithm for cutting stock problem
by: Jonas Pokštas, et al.
Published: (2023-09-01) -
Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems
by: Tatsuhiko Shirai, et al.
Published: (2024-01-01) -
Optimal Positioning of Unmanned Aerial Vehicle (UAV) Base Stations Using Mixed-Integer Linear Programming
by: Gowtham Raj Veeraswamy Premkumar, et al.
Published: (2025-01-01) -
Optimization Techniques in Electric Vehicle Charging Scheduling, Routing and Spatio-Temporal Demand Coordination: A Systematic Review
by: Eiman Elghanam, et al.
Published: (2024-01-01) -
Heuristic Approach to Comparing the Environmental Impacts of Carbon Nanotube Production Methods
by: Ahmad Atif Fikri, et al.
Published: (2024-07-01)