A Simple, Robust Leadtime-Quoting Policy
Authors:
- 1 October 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 3 (4) , 321-336
Abstract
We examine leadtime-quoting polices for minimizing average lead time subject to customer service constraints on fill rate, tardiness, or relative tardiness in simple systems with exponential and normal processing times. By studying the resulting safety leadtimes implied by each policy we gain insight into why some policies perform more robustly with respect to different measures of customer service than do others. This analysis suggests that a simple constant safety leadtime policy should work reasonably well under most conditions. A series of simulation experiments of more complex production environments indicates that the constant safety leadtime policy does indeed exhibit robust performance. This, plus the fact that it is extremely simple to adapt to a wide range of production environments, makes it an attractive basis for real-world leadtime-quoting systems.Keywords
This publication has 16 references indexed in Scilit:
- Quoting manufacturing due dates subject to a service level constraintIIE Transactions, 2000
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignmentComputers & Operations Research, 1998
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination methodEuropean Journal of Operational Research, 1998
- Manufacturing lead times, system utilization rates and lead-time-related demandEuropean Journal of Operational Research, 1996
- Estimating flowtimes and setting due-dates in complex production systemsIIE Transactions, 1995
- Using Neural Networks to Determine Internally‐Set Due‐Date Assignments for Shop Scheduling*Decision Sciences, 1994
- The job shop tardiness problem: A decomposition approachEuropean Journal of Operational Research, 1993
- An investigation of due-date assignment using workload information of a dynamic shopInternational Journal of Production Economics, 1993
- Due Date Assignment in a Multistage Job ShopIIE Transactions, 1989
- Setting Job-Shop Due-Dates with Service-Level ConstraintsJournal of the Operational Research Society, 1985