Due date assignment for multistage assembly systems

This paper is concerned with the study of the constant due-date assignment policy in a multistage assembly system. The multistage assembly system is modeled as an open queueing network. It is assumed that the product order arrives according to a Poisson process. In each service station, there is either one or infinite machine with exponentially distributed processing time. The transport times between every pair of service stations are independent random variables with generalized Erlang distributions. It is assumed that each product has a penalty cost that is some linear function of its due-date and its actual completion time. The due date is found by adding a constant to the time that the order arrives. This constant value is the constant lead time that a product might expect between time of placing the order and time of delivery. By applying the longest path analysis in queueing networks, we obtain the distribution function of manufacturing lead time. Then, the optimal constant lead time is computed by minimizing the expected aggregate cost per product. Finally, the results are verified by Monte Carlo simulation.

[1]  H. M. Soroush,et al.  Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs , 1999, Eur. J. Oper. Res..

[2]  D. P. Songa,et al.  Product due date assignment for complex assemblies , 2002 .

[3]  J. Harrison.  Assembly-like queues , 1973, Journal of Applied Probability.

[4]  N. Hemachandra,et al.  Performance analysis and buffer allocations in some open assembly systems , 2003, Comput. Oper. Res..

[5]  Candace Aral Yano,et al.  Stochastic Leadtimes in Two-Level Assembly Systems , 1987 .

[6]  Asha S. Kapadia,et al.  Steady state waiting time in a multicenter job shop , 1978 .

[7]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[8]  Salah E. Elmaghraby,et al.  Optimal start times under stochastic activity durations , 2000 .

[9]  Vidyadhar G. Kulkarni,et al.  Markov and Markov-Regenerative pert Networks , 1986, Oper. Res..

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

[11]  E. H. Lipper,et al.  Assembly-like queues with finite capacity: Bounds, asymptotics and approximations , 1986, Queueing Syst. Theory Appl..

[12]  Hermann Gold,et al.  A Markovian single server with upstream job and downstream demand arrival stream , 1998, Queueing Syst. Theory Appl..

[13]  R. H. Myers,et al.  STAT 319 : Probability & Statistics for Engineers & Scientists Term 152 ( 1 ) Final Exam Wednesday 11 / 05 / 2016 8 : 00 – 10 : 30 AM , 2016 .

[14]  R. H. Myers,et al.  Probability and Statistics for Engineers and Scientists , 1978 .

[15]  Amir Azaron,et al.  Optimal control of service rates and arrivals in Jackson networks , 2003, Eur. J. Oper. Res..

[16]  G. Thompson,et al.  Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .

[17]  Brian G. Kingsman,et al.  Modelling flow and jobbing shops as a queueing network for workload control , 2002 .

[18]  H. T. Papadopoulos,et al.  Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines , 1996 .

[19]  Amir Azaron,et al.  Distribution function of the shortest path in networks of queues , 2005, OR Spectr..

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

[21]  Nico Vandaele,et al.  An open queueing network for lead time analysis , 2002 .

[22]  Amir Azaron.  Multiobjective optimal control in stochastic and dynamic networks with applications using shortest and longest path approaches , 2005 .

[23]  Amir Azaron,et al.  Modelling complex assemblies as a queueing network for lead time control , 2006, Eur. J. Oper. Res..

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