A Simple, Robust Leadtime-Quoting Policy

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.

[1]  Nabil R. Adam,et al.  Due date assignment procedures with dynamically updated coefficients for multi-level assembly job shops , 1993 .

[2]  Stephen R. Lawrence,et al.  Estimating flowtimes and setting due-dates in complex production systems , 1995 .

[3]  Izak Duenyas,et al.  Single facility due date setting with multiple customer classes , 1995 .

[4]  Narayan Raman,et al.  The job shop tardiness problem: A decomposition approach , 1993 .

[5]  R. Larsen,et al.  An introduction to mathematical statistics and its applications (2nd edition) , by R. J. Larsen and M. L. Marx. Pp 630. £17·95. 1987. ISBN 13-487166-9 (Prentice-Hall) , 1987, The Mathematical Gazette.

[6]  Godwin J. Udo An investigation of due-date assignment using workload information of a dynamic shop , 1993 .

[7]  T.C.E. Cheng,et al.  Survey of scheduling research involving due date determination decisions , 1989 .

[8]  Nico Dellaert Due-date setting and production control , 1991 .

[9]  Xiangton Qi,et al.  Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method , 1998, Eur. J. Oper. Res..

[10]  Wallace J. Hopp,et al.  Quoting manufacturing due dates subject to a service level constraint , 2000 .

[11]  James H. Bookbinder,et al.  Setting Job-Shop Due-Dates with Service-Level Constraints , 1985 .

[12]  George Jr. Stalk Hout Competing Against Time : How Time Based Competition Is Reshaping Global Markets , 2002 .

[13]  S. T. Enns,et al.  Job shop leadtime requirements under conditions of controlled delivery performance , 1994 .

[14]  Vitaly A. Strusevich,et al.  Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment , 1997, Comput. Oper. Res..

[15]  Loren Paul Rees,et al.  Using Neural Networks to Determine Internally-Set Due-Date Assignments for Shop Scheduling* , 1994 .

[16]  Timothy D. Fry,et al.  Due Date Assignment in a Multistage Job Shop , 1989 .

[17]  Z. K. Weng,et al.  Manufacturing lead times, system utilization rates and lead-time-related demand , 1996 .

[18]  M. Spearman,et al.  Optimal Lead Time Policies , 1999 .