Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 217-229 |
| Seitenumfang | 13 |
| Fachzeitschrift | IISE Transactions |
| Jahrgang | 50 |
| Ausgabenummer | 3 |
| Frühes Online-Datum | 20 Okt. 2017 |
| Publikationsstatus | Veröffentlicht - 2018 |
Abstract
We consider the problem of scheduling production lots for multiple products competing for a common production resource that processes the product units serially. The demand for each product and period is assumed to be known with certainty, but the yield per production lot is random as the production process can reach an out-of-control state while processing each single product unit of a lot. A service-level constraint is used to limit the backlog in the presence of this yield uncertainty. We address the question of how to determine static production lots and how to schedule these lots over the discrete periods of a finite planning horizon. The scheduling problem is characterized by a trade-off between the cost of holding inventory and the cost of overtime, whereas the production output is uncertain. For this purpose, we develop a rigid and robust planning approach and two flexible heuristic scheduling approaches. In an extensive numerical study, we compare the different approaches to assess the cost of operating according to a robust plan as opposed to a flexible policy.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Wirtschaftsingenieurwesen und Fertigungstechnik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: IISE Transactions, Jahrgang 50, Nr. 3, 2018, S. 217-229.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Flexible versus robust lot-scheduling subject to random production yield and deterministic dynamic demand
AU - Helber, Stefan
AU - Inderfurth, Karl
AU - Sahling, Florian
AU - Schimmelpfeng, Katja
N1 - Publisher Copyright: Copyright © 2018 “IISE”. Copyright: Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2018
Y1 - 2018
N2 - We consider the problem of scheduling production lots for multiple products competing for a common production resource that processes the product units serially. The demand for each product and period is assumed to be known with certainty, but the yield per production lot is random as the production process can reach an out-of-control state while processing each single product unit of a lot. A service-level constraint is used to limit the backlog in the presence of this yield uncertainty. We address the question of how to determine static production lots and how to schedule these lots over the discrete periods of a finite planning horizon. The scheduling problem is characterized by a trade-off between the cost of holding inventory and the cost of overtime, whereas the production output is uncertain. For this purpose, we develop a rigid and robust planning approach and two flexible heuristic scheduling approaches. In an extensive numerical study, we compare the different approaches to assess the cost of operating according to a robust plan as opposed to a flexible policy.
AB - We consider the problem of scheduling production lots for multiple products competing for a common production resource that processes the product units serially. The demand for each product and period is assumed to be known with certainty, but the yield per production lot is random as the production process can reach an out-of-control state while processing each single product unit of a lot. A service-level constraint is used to limit the backlog in the presence of this yield uncertainty. We address the question of how to determine static production lots and how to schedule these lots over the discrete periods of a finite planning horizon. The scheduling problem is characterized by a trade-off between the cost of holding inventory and the cost of overtime, whereas the production output is uncertain. For this purpose, we develop a rigid and robust planning approach and two flexible heuristic scheduling approaches. In an extensive numerical study, we compare the different approaches to assess the cost of operating according to a robust plan as opposed to a flexible policy.
KW - Random yield
KW - flexible heuristic policy
KW - lot scheduling
KW - robust planning
UR - http://www.scopus.com/inward/record.url?scp=85031808581&partnerID=8YFLogxK
U2 - 10.1080/24725854.2017.1357089
DO - 10.1080/24725854.2017.1357089
M3 - Article
VL - 50
SP - 217
EP - 229
JO - IISE Transactions
JF - IISE Transactions
IS - 3
ER -