Explicit Modeling of Multi-Product Customer Orders in a Multi-Period Production Planning Model

In many industries, companies receive customer orders that include multiple products. To simplify the use of optimization models for planning purposes, these orders are broken down, and the quantities of each product are grouped with the same products from other orders to be completed in the same period. Consequently, traditional production planning models enforce minimum demand constraints by product and period rather than by individual orders. An important drawback of this aggregation procedure is that it requires a fixed order fulfillment period, potentially missing opportunities for more efficient resource use through early completion. This paper introduces a novel mathematical formulation that preserves the integrity of customer orders, allowing for early fulfillment when possible. We compare a traditional linear programming model with a new mixed-integer programming approach using a sawmill case study. Although more complex than the traditional model, the proposed formulation reduces costs by approximately 6% by enabling early order completion and offers greater flexibility and control over the production process. This approach leads to better resource utilization and more precise order management, presenting a valuable alternative to conventional production planning models.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-09-27
DOI
https://doi.org/10.3390/math12193029
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Explicit Modeling of Multi-Product Customer Orders in a Multi-Period Production Planning Model

Cristian D. Palma, Sebastián Muñoz-Herrera, Francisco P. Vergara
1 citations
Mathematics
Scheduling and Optimization Algorithms
0.35
article

Explicit Modeling of Multi-Product Customer Orders in a Multi-Period Production Planning Model

Cristian D. Palma, Sebastián Muñoz-Herrera, Francisco P. Vergara
article en
1 citations

Abstract

In many industries, companies receive customer orders that include multiple products. To simplify the use of optimization models for planning purposes, these orders are broken down, and the quantities of each product are grouped with the same products from other orders to be completed in the same period. Consequently, traditional production planning models enforce minimum demand constraints by product and period rather than by individual orders. An important drawback of this aggregation procedure is that it requires a fixed order fulfillment period, potentially missing opportunities for more efficient resource use through early completion. This paper introduces a novel mathematical formulation that preserves the integrity of customer orders, allowing for early fulfillment when possible. We compare a traditional linear programming model with a new mixed-integer programming approach using a sawmill case study. Although more complex than the traditional model, the proposed formulation reduces costs by approximately 6% by enabling early order completion and offers greater flexibility and control over the production process. This approach leads to better resource utilization and more precise order management, presenting a valuable alternative to conventional production planning models.

MathematicsVol. 12(19)
Universidad del Desarrollo (CL), University of Bío-Bío (CL)
Openalex Percentile: Top 36%
Scheduling and Optimization Algorithms
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.