Multi-Product Production Scheduling with Limited Warehouse Space: a Four-Step Approach

The research considers a production scheduling problem for the system where multiple products are produced on a single production line on a rotating basis. All finished products are stored in the same limited-capacity warehouse. With a storage space restriction, the scheduling objective is to minimize the total variable cost, which includes production setup and inventory holding costs. The four-step approach is presented to determine the proper production run size and the production schedule for each run. A numerical experiment on 180 randomly generated problems is conducted to evaluate the performance of the proposed method. The result indicates that the four-step approach can reduce the total variable cost by approximately 10.74% compared to a traditional solution. The difference is more emphasized when the slack time ratio is increased.

Authors

Institutions

Publication Details

Published
2025-05-22
DOI
https://doi.org/10.1109/icbir65229.2025.11163382
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-Product Production Scheduling with Limited Warehouse Space: a Four-Step Approach

Wisut Supithak, Titirat Vivithkeyoonvong
Scheduling and Optimization Algorithms
article

Multi-Product Production Scheduling with Limited Warehouse Space: a Four-Step Approach

Wisut Supithak, Titirat Vivithkeyoonvong
article en

Abstract

The research considers a production scheduling problem for the system where multiple products are produced on a single production line on a rotating basis. All finished products are stored in the same limited-capacity warehouse. With a storage space restriction, the scheduling objective is to minimize the total variable cost, which includes production setup and inventory holding costs. The four-step approach is presented to determine the proper production run size and the production schedule for each run. A numerical experiment on 180 randomly generated problems is conducted to evaluate the performance of the proposed method. The result indicates that the four-step approach can reduce the total variable cost by approximately 10.74% compared to a traditional solution. The difference is more emphasized when the slack time ratio is increased.

Kasetsart University (TH)
Openalex Percentile: Top 65%
Scheduling and Optimization Algorithms
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.