Job flow control in assembly operations

IEEE Transactions on Automatic Control

Volumn 44, Issue 4, 1999, Pages 864-868

  Ayhan, Hayriye ^a   Wortman, Martin A ^b  

^a Georgia Institute of Technology   (United States)

^b Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ASSEMBLY; DIFFERENCE EQUATIONS; GRAPH THEORY; LINEAR EQUATIONS; MATHEMATICAL MODELS; PROBABILITY; PROCESS CONTROL; RANDOM PROCESSES;

CYCLE TIME; EVENTS GRAPH; JOB FLOW CONTROL;

FEEDBACK CONTROL;

EID: 0032672266     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.754835     Document Type: Article

References (16)

1. H. Ayhan and M. A. Wortman, "An approximation for computing the throughput of closed assembly-type queueing networks," to be published.
2. F. Baccelli, G. Kohen, G. J. Olsder, and J.-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems. Chichester, U.K.: Wiley, 1992.
3. F. Baccelli, A. M. Makowski, and M. Schwartz, "The fork-join queue and related systems with synchronization constraints: Stochastic ordering, approximations and computable bounds," Adv. Appl. Prob., vol. 21, pp. 629-647, 1989.
4. F. Baccelli, W. A. Massey, and D. Towsley, "Acyclic fork-join queueing networks," J. ACM, vol. 36, pp. 615-642, 1989.
5. X. Bai, N. Srinivatsan, and S. B. Gershwin, "Hierarchical real time scheduling of a semiconductor fabrication facility," in Proc. IEEE/CHMT IEMT Symp. 1990, pp. 312-317.
6. A. Brondsted, An Introduction to Convex Polytopes. New York: Springer-Verlag, 1983.
7. P. J. Davis and P. Rabinowitz, Methods of Numerical Integration. New York: Academic, 1975.
8. I. Duenyas, "Estimating the throughput of acyclic assembly system," Int. J. Prod. Res., vol. 32, pp. 1403-1419, 1994.
9. I. Duenyas and W. J. Hopp, "CONWIP assembly with deterministic processing and random outages," IEEE Trans. Automat. Contr., vol. 24, pp. 97-109, 1992.
10. _, "Estimating the throughput of an exponential CONWIP assembly system," Queueing Syst., vol. 14, pp. 135-157, 1993.
11. I. Duenyas and M. F. Keblis, "Release policies for assembly systems," IIE Trans., vol. 27, pp. 507-518, 1995.
12. S. B. Gershwin, "Assembly/disassembly systems: An efficient decomposition algorithm for tree-structured networks," IIE Trans., vol. 23, pp. 302-314, 1991.
13. S. B. Gershwin, R. Akella, and Y. F. Choong, "Short-term production scheduling of an automated manufacturing facility," IBM. J. Res. Develop., vol. 29, pp. 392-400, 1985.
14. J. Hazra and A. Seidmann, "Performance evaluation of closed tree-structured assembly systems," IEEE Trans. Automat. Contr., vol. 28, pp. 591-599, 1996.
15. J. Kimemia and S. B. Gershwin, "An algorithm for computer control of a flexible manufacturing system," IEE Trans., vol. 15, pp. 353-362, 1983.
16. V. Nguyen, "Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits," Ann. Appl., vol. 3, pp. 28-55, 1993.