A Make-to-Order Capacitated Lot-Sizing Model with Parallel Machines, Eligibility Constraints, Extra Shifts, and Backorders

Guardado en:
Bibliografiske detaljer
Udgivet i:Mathematics vol. 13, no. 11 (2025), p. 1798
Hovedforfatter: Muñoz, Felipe T
Andre forfattere: Ulloa-Navarro, Juan
Udgivet:
MDPI AG
Fag:
Online adgang:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

MARC

LEADER 00000nab a2200000uu 4500
001 3217737934
003 UK-CbPIL
022 |a 2227-7390 
024 7 |a 10.3390/math13111798  |2 doi 
035 |a 3217737934 
045 2 |b d20250101  |b d20251231 
084 |a 231533  |2 nlm 
100 1 |a Muñoz, Felipe T  |u Departamento de Ingeniería Industrial, Facultad de Ingeniería, Universidad del Bío-Bío, Concepcion 4051381, Chile 
245 1 |a A Make-to-Order Capacitated Lot-Sizing Model with Parallel Machines, Eligibility Constraints, Extra Shifts, and Backorders 
260 |b MDPI AG  |c 2025 
513 |a Journal Article 
520 3 |a This study addresses the multi-period, multi-item, single-stage capacitated lot sizing problem (CLSP) in a parallel machine environment with machine eligibility constraints under a make-to-order production policy. A mixed-integer linear programming (MILP) model is developed to minimize total operational costs, including production, overtime, extra shifts, inventory holding, and backorders. The make-to-order setting introduces additional complexity by requiring individualized customer orders, each with specific due dates and product combinations, to be scheduled under constrained capacity and setup requirements. The model’s performance is evaluated in the context of a real-world production planning problem faced by a manufacturer of cold-formed steel profiles. In this setting, parallel forming machines process galvanized sheets of cold-rolled steel into a variety of profiles. The MILP model is solved using open-source optimization tools, specifically the HiGHS solver. The results show that optimal solutions can be obtained within reasonable computational times. For more computationally demanding instances, a runtime limit of 300 s is shown to improve solution quality while maintaining efficiency. These findings confirm the viability and cost-effectiveness of free software for solving complex industrial scheduling problems. Moreover, experimental comparisons reveal that solution times and performance can be further improved by using commercial solvers such as CPLEX, highlighting the potential trade-off between cost and computational performance. 
653 |a Cold-rolled steel 
653 |a Cold 
653 |a Linear programming 
653 |a Forming machines 
653 |a Performance evaluation 
653 |a Integer programming 
653 |a Mathematical models 
653 |a Solvers 
653 |a Production planning 
653 |a Metal sheets 
653 |a Operating costs 
653 |a Manufacturing 
653 |a Workloads 
653 |a Lot sizing 
653 |a Cost effectiveness 
653 |a Mathematical programming 
653 |a Scheduling 
653 |a Cold-formed steel 
653 |a Raw materials 
653 |a Galvanized steel 
653 |a Decision making 
653 |a Optimization 
653 |a Produce to order 
653 |a Construction costs 
653 |a Mixed integer 
653 |a Complexity 
653 |a Metalworking industry 
653 |a Constraints 
653 |a Inventory 
653 |a Backorders 
653 |a Cold working 
700 1 |a Ulloa-Navarro, Juan  |u Independent Researcher, Concepcion 4051381, Chile 
773 0 |t Mathematics  |g vol. 13, no. 11 (2025), p. 1798 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3217737934/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text + Graphics  |u https://www.proquest.com/docview/3217737934/fulltextwithgraphics/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3217737934/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch