Using simulation to evaluate buffer adjustment methods in order promising

Much literature exists for scheduling production, but there is little work on establishing the due dates that serve as the inputs to developing a production schedule. We call this order promising. This paper explores a simulation-based approach for evaluating methods for promising the delivery of orders based on dynamic buffer adjustment coupled with various methods to forecast the amount of buffer required. The primary objective of the paper is to frame the problem and suggest methods of analysis. Preliminary computational results are also presented.

[1]  Hanan Luss,et al.  A due date assignment algorithm for multiproduct manufacturing facilities , 1993 .

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

[3]  Samuel Eilon,et al.  Due dates in job shop scheduling , 1976 .

[4]  Kut C. So,et al.  A due-date assignment model for a flow shop with application in a lightguide cable shop , 1991 .

[5]  Lawrence M. Wein,et al.  A broader view of the job-shop scheduling problem , 1992 .

[6]  J. Bertrand.  The Effect of Workload Dependent Due-Dates on Job Shop Performance , 1983 .

[7]  Abraham Seidmann,et al.  Due date selection procedures for job-shop simulation , 1983 .

[8]  T.C.E. Cheng,et al.  Optimal TWK-power due-date determination and sequencing , 1987 .

[9]  P. De,et al.  Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[10]  J. Shanthikumar,et al.  Approximations for the time spent in a dynamic job shop with applications to due-date assignment , 1988 .

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

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

[13]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[14]  Kevin J. Dooley,et al.  Mixing static and dynamic flowtime estimates for due-date assignment , 1993 .

[15]  Z. K. Weng,et al.  Strategies for integrating lead time and customer-order decisions , 1999 .

[16]  Candace Aria Yano,et al.  Setting Planned Leadtimes in Serial Production Systems with Tardiness Costs , 1987 .

[17]  James K. Weeks.  A Simulation Study of Predictable Due-Dates , 1979 .

[18]  Gary L. Ragatz,et al.  A framework for the study of due date management in job shops , 1984 .

[19]  Ali Tamer Unal,et al.  A probabilistic cost-based due date assignment model for job shops , 1993 .

[20]  Dean H. Kropp,et al.  Lead-time setting, capacity utilization, and pricing decisions under lead-time dependent demand , 1998 .

[21]  T.C.E. Cheng,et al.  Due-date assignment and single machine scheduling with compressible processing times , 1996 .

[22]  P. De,et al.  Solving a generalized model for CON due date assignment and sequencing , 1994 .

[23]  W. Hopp,et al.  Quoting Customer Lead Times , 1995 .

[24]  T. S. Raghu,et al.  Due-date setting methodologies based on simulated annealing—an experimental study in a real-life job shop , 1995 .

[25]  E. L. Heard,et al.  Due-Dates and Instantaneous Load in the One-Machine Shop , 1976 .

[26]  T. Cheng.  Integration of priority dispatching and due-date assignment in a job shop , 1988 .

[27]  Hector Garcia-Molina,et al.  Scheduling real-time transactions , 1988, SGMD.

[28]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

[29]  A. Alan B. Pritsker,et al.  Simulation with Visual SLAM and AweSim, 2nd Edition , 1999 .

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

[31]  Kevin J. Dooley,et al.  Dynamic rules for due-date assignment , 1991 .

[32]  Le Gruenwald,et al.  A Logging Technique Based on Transaction Types in Real-Time Databases , 1997, RTDB.

[33]  T.C.E. Cheng.  Optimal due-date assignment in a job shop† , 1986 .

[34]  T.C.E. Cheng.  Optimal Assignment of Total-work-content Due-dates and Sequencing in a Single-machine Shop , 1991 .

[35]  K. R. Baker,et al.  An investigation of due-date assignment rules with constrained tightness , 1981 .

[36]  Le Gruenwald,et al.  Effects of Deadline Propagation on Scheduling Nested Transactions in Distributed Real-Time Database Systems , 1996, Inf. Syst..

[37]  Abraham Seidmann,et al.  Due Date Assignment for Production Systems , 1981 .

[38]  T.C.E. Cheng,et al.  Due-date determination with resequencing , 1999 .

[39]  P. De,et al.  Optimal due-date assignment and sequencing , 1992 .

[40]  Uttarayan Bagchi,et al.  Due-date assignment to multi-job customer orders , 1994 .

[41]  Sirirut Vanichayobon,et al.  Database research at the University of Oklahoma , 1999, SGMD.

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

[43]  R.-K. Li,et al.  Integrating order release control with due-date assignment rules , 1997 .

[44]  G. Ragatz,et al.  A simulation analysis of due date assignment rules , 1984 .