Optimal leadtimes planning in serial production systems with earliness and tardiness costs
Author:
- 1 March 2002
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 34 (3) , 233-243
Abstract
We consider a production system consisting of >N processing stages. The actual leadtimes at the stages are stochastic. The objective is to determine the planned leadtimes at each stage so as to minimize the expected total inventory costs, tardiness penalties, and a backlog penalty for not meeting demand due date at the last stage. Recursive relationships are used for automatic generation and efficient computation of the objective function. The efficiency of the proposed algorithms allows us to obtain new insights regarding operating policies, leadtime delivery reliability, and production line design. The problem is formulated as a convex non-linear programming problem. The latter is then solved using classical convex optimization algorithms. For the special case of exponentially distributed leadtimes, the objective function is derived in a closed form.Keywords
This publication has 8 references indexed in Scilit:
- Optimal Leadtimes Planning in a Serial Production SystemManagement Science, 1994
- Planned Leadtimes For Serial Production SystemsIIE Transactions, 1987
- Dynamically Adjusting the Number of Kanbans in a Just-in-Time Production System Using Estimated Values of LeadtimeIIE Transactions, 1987
- Setting Planned Leadtimes in Serial Production Systems with Tardiness CostsManagement Science, 1987
- Computational Issues in an Infinite-Horizon, Multiechelon Inventory ModelOperations Research, 1984
- A simulation-based experimental investigation of supply/timing uncertainty in MRP systemsInternational Journal of Production Research, 1984
- MATERIAL REQUIREMENTS PLANNING UNDER UNCERTAINTYDecision Sciences, 1976
- Optimal Policies for a Multi-Echelon Inventory ProblemManagement Science, 1960