Automated lead time estimation for manufacturing networks with dynamic demand

Ronald Askin, Girish Jampani Hanumantha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publication2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017
PublisherIEEE Computer Society
Pages994-999
Number of pages6
Volume2017-August
ISBN (Electronic)9781509067800
DOIs
StatePublished - Jan 12 2018
Event13th IEEE Conference on Automation Science and Engineering, CASE 2017 - Xi'an, China
Duration: Aug 20 2017Aug 23 2017

Other

Other13th IEEE Conference on Automation Science and Engineering, CASE 2017
CountryChina
CityXi'an
Period8/20/178/23/17

Fingerprint

Scheduling

Keywords

  • Dynamic Demand
  • Lead Time Forecasting
  • Queueing Networks

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Askin, R., & Hanumantha, G. J. (2018). Automated lead time estimation for manufacturing networks with dynamic demand. In 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017 (Vol. 2017-August, pp. 994-999). IEEE Computer Society. https://doi.org/10.1109/COASE.2017.8256232

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 proceedingConference contribution

Askin, R & Hanumantha, GJ 2018, Automated lead time estimation for manufacturing networks with dynamic demand. in 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. vol. 2017-August, IEEE Computer Society, pp. 994-999, 13th IEEE Conference on Automation Science and Engineering, CASE 2017, Xi'an, China, 8/20/17. https://doi.org/10.1109/COASE.2017.8256232
Askin R, Hanumantha GJ. Automated lead time estimation for manufacturing networks with dynamic demand. In 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August. IEEE Computer Society. 2018. p. 994-999 https://doi.org/10.1109/COASE.2017.8256232
Askin, Ronald ; Hanumantha, Girish Jampani. / Automated lead time estimation for manufacturing networks with dynamic demand. 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017. Vol. 2017-August IEEE Computer Society, 2018. pp. 994-999
@inproceedings{b6ffa1d8f0be49a8845ffdadf33b8610,
title = "Automated lead time estimation for manufacturing networks with dynamic demand",
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.",
keywords = "Dynamic Demand, Lead Time Forecasting, Queueing Networks",
author = "Ronald Askin and Hanumantha, {Girish Jampani}",
year = "2018",
month = "1",
day = "12",
doi = "10.1109/COASE.2017.8256232",
language = "English (US)",
volume = "2017-August",
pages = "994--999",
booktitle = "2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017",
publisher = "IEEE Computer Society",

}

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 -