2014
DOI: 10.1080/00207543.2014.935514
|View full text |Cite
|
Sign up to set email alerts
|

Zero-order production planning models with stochastic demand and workload-dependent lead times

Abstract: We present three different formulations of a simple production planning problem that treat workload-dependent lead times, limited capacity and stochastic demand in an integrated fashion. We compare chance-constrained models, two-stage stochastic programming and robust optimisation using computational experiments. Our results show that the robust optimisation approach is promising, but all the different models face different but challenging issues in addressing this complex problem. We also conclude that succes… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(8 citation statements)
references
References 62 publications
0
8
0
Order By: Relevance
“…These techniques tend to be computationally less demanding than stochastic programming, but also represent uncertainty and its consequences in different ways. Aouam and Uzsoy [28,29] compare a number of these models in the context of a very simple single-stage production-inventory system under stochastic demand, and find that they need to be parameterized with care to yield desirable results.…”
Section: Literature Reviewmentioning
confidence: 99%
“…These techniques tend to be computationally less demanding than stochastic programming, but also represent uncertainty and its consequences in different ways. Aouam and Uzsoy [28,29] compare a number of these models in the context of a very simple single-stage production-inventory system under stochastic demand, and find that they need to be parameterized with care to yield desirable results.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, when used in field applications, MRP shows some weak points: it ignores facilities capacity constraints and assumes fixed lead-times (Rossi and Pero 2011;Jodlbauer and Reitner 2012;Sun et al 2012;Dolgui et al 2013;Aouam and Uzsoy 2015). Either shortcoming above leads to infeasible production schedules, fluctuating workloads over time and significant users' effort to adjust the plans.…”
Section: Introductionmentioning
confidence: 99%
“…constraints (13) are not satisfied. In this case, the toolset is unable to process all its affected steps during the considered period so its loading should be balanced over subsequent periods.…”
Section: Workload/capacity Balancing Modulementioning
confidence: 99%
“…Indeed, it is proven that MRP method can be inefficient and may produce unrealistic production schedules when used in field applications. It ignores capacity constraints and assumes fixed cycle times ( [10], [11], [12], [13]). However, in semiconductor facilities, cycle times depend on many factors, such as machine utilization rate, lot size, inventory and dispatching rules, and are thus variable.…”
Section: Previous Related Workmentioning
confidence: 99%