Abstract
Efficient algorithms are essential for reliable lead time forecasting as they are often the basis for subsequent activities such as planned order releases and shop scheduling. Dynamic conditions are prevalent in modern manufacturing systems and reliable lead time forecasts can provide a competitive edge operationally. In this paper, we explore the use of efficient algorithms for steady state analysis to develop approximate estimates of lead times under dynamic conditions.
| Original language | English (US) |
|---|---|
| Title of host publication | 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017 |
| Publisher | IEEE Computer Society |
| Pages | 994-999 |
| Number of pages | 6 |
| Volume | 2017-August |
| ISBN (Electronic) | 9781509067800 |
| DOIs | |
| State | Published - Jan 12 2018 |
| Event | 13th IEEE Conference on Automation Science and Engineering, CASE 2017 - Xi'an, China Duration: Aug 20 2017 → Aug 23 2017 |
Other
| Other | 13th IEEE Conference on Automation Science and Engineering, CASE 2017 |
|---|---|
| Country | China |
| City | Xi'an |
| Period | 8/20/17 → 8/23/17 |
Fingerprint
Keywords
- Dynamic Demand
- Lead Time Forecasting
- Queueing Networks
ASJC Scopus subject areas
- Control and Systems Engineering
- Electrical and Electronic Engineering
Cite this
Automated lead time estimation for manufacturing networks with dynamic demand. / Askin, Ronald; Hanumantha, Girish Jampani.
2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August IEEE Computer Society, 2018. p. 994-999.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Automated lead time estimation for manufacturing networks with dynamic demand
AU - Askin, Ronald
AU - Hanumantha, Girish Jampani
PY - 2018/1/12
Y1 - 2018/1/12
N2 - Efficient algorithms are essential for reliable lead time forecasting as they are often the basis for subsequent activities such as planned order releases and shop scheduling. Dynamic conditions are prevalent in modern manufacturing systems and reliable lead time forecasts can provide a competitive edge operationally. In this paper, we explore the use of efficient algorithms for steady state analysis to develop approximate estimates of lead times under dynamic conditions.
AB - Efficient algorithms are essential for reliable lead time forecasting as they are often the basis for subsequent activities such as planned order releases and shop scheduling. Dynamic conditions are prevalent in modern manufacturing systems and reliable lead time forecasts can provide a competitive edge operationally. In this paper, we explore the use of efficient algorithms for steady state analysis to develop approximate estimates of lead times under dynamic conditions.
KW - Dynamic Demand
KW - Lead Time Forecasting
KW - Queueing Networks
UR - http://www.scopus.com/inward/record.url?scp=85044971015&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85044971015&partnerID=8YFLogxK
U2 - 10.1109/COASE.2017.8256232
DO - 10.1109/COASE.2017.8256232
M3 - Conference contribution
VL - 2017-August
SP - 994
EP - 999
BT - 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017
PB - IEEE Computer Society
ER -