Job flow control in assembly operations

The authors develop a state variable feedback control for a class of assembly operations. The objective of this control is to increase the number of jobs completed within a time horizon T while keeping the job cycle times within an acceptable range with a prespecified probability. The assembly operations are modeled as stochastic timed-event graphs which in the (max, +) algebra are characterized by a set of linear stochastic difference equations.

[1]  Abraham Seidmann,et al.  Performance evaluation of closed tree-structured assembly systems , 1996 .

[2]  Izak Duenyas,et al.  Estimating the throughput of a cyclic assembly system , 1994 .

[3]  Hayriye Ayhan,et al.  An approximation for computing the throughput of closed assembly-type queueing networks , 1999, Eur. J. Oper. Res..

[4]  Andrew Kusiak,et al.  Work-in-process space allocation: a model and an industrial application , 1995 .

[5]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[6]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[7]  Viên Nguyen.  Processing Networks with Parallel and Sequential Tasks: Heavy Traffic Analysis and Brownian Limits , 1993 .

[8]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

[9]  Stanley B. Gershwin,et al.  Hierarchical real-time scheduling of a semiconductor fabrication facility , 1990, Ninth IEEE/CHMT International Symposium on Electronic Manufacturing Technology,Competitive Manufacturing for the Next Decade.

[10]  Stanley B. Gershwin,et al.  Short term production scheduling of an automated manufacturing facility , 1984, The 23rd IEEE Conference on Decision and Control.

[11]  Armand M. Makowski,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering,approximations and computable bounds , 1986 .

[12]  A. Brøndsted.  An Introduction to Convex Polytopes , 1982 .

[13]  Donald F. Towsley,et al.  Acyclic fork-join queuing networks , 1989, JACM.

[14]  W. Hopp,et al.  CONWIP ASSEMBLY WITH DETERMINISTIC PROCESSING AND RANDOM OUTAGES , 1992 .

[15]  Stanley B. Gershwin,et al.  Assembly/Disassembly Systems: An Efficient Decomposition Algorithm for Tree-Structured Networks , 1991 .

[16]  F. Baccelli,et al.  The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds , 1989, Advances in Applied Probability.

[17]  Izak Duenyas,et al.  Release policies for assembly systems , 1995 .

[18]  Wallace J. Hopp,et al.  Estimating the throughput of an exponential CONWIP assembly system , 1993, Queueing Syst. Theory Appl..