Lead-time analysis and a control policy for production lines

We address a control problem for a production line that produces one product to stock and faces random demand. During stockouts, the system quotes a fixed response time for each arriving order, and the customers place their orders only if the response time promised meets their deadlines. Customer or...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 49; no. 7; pp. 2019 - 2034
Main Authors Economopoulos, Angelos A., Kouikoglou, Vassilis S.
Format Journal Article
LanguageEnglish
Published Abingdon Taylor & Francis Group 01.04.2011
Taylor & Francis
Taylor & Francis LLC
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We address a control problem for a production line that produces one product to stock and faces random demand. During stockouts, the system quotes a fixed response time for each arriving order, and the customers place their orders only if the response time promised meets their deadlines. Customer orders are filled on a first come, first served basis. A penalty cost is incurred whenever a customer is served later than promised. A two-parameter admission/inventory control policy is implemented that maintains a bounded backlog and a constant inventory position (total inventory minus backlog) in the system. For production lines with exponential processing times and Poisson demand, the mean profit rate of the system is computed analytically using closed queueing network formulae. For systems with general processing or interarrival time distributions, the profit rate is estimated via simulation. Simple properties are established that ensure that the profit maximising control parameters can be determined in finite time using exhaustive search. Numerical results show that the proposed policy performs better than the make-to-order/zero-inventory and the lost-sales/make-to-stock policies.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207541003627845