Abstract
In manufacturing systems, the finished products are frequently produced by assembling a set of semifinished products or subassemblies. The fundamental characteristic of assembly systems is that a certain number of units from each input material are assembled to produce one unit of the finished product. The assembled units may include raw materials, subassemblies, semifinished units, or even finished products. The assembly activity may be a single operation that takes place in one work station or it may be a sequence of operations performed in a group of stations. For instance, the transfer lines covered in Chapter 5 may be considered as the special case of multistage assembly systems in which one or more units of raw material are assembled to the main assembly at every station. A manufacturing system may consist of a network of assembly, subassembly, and regular work stations, as shown in Fig 6.1. The immediate upstream buffers of an assembly station may be called “matching buffers” and may be assumed to be part of the assembly station. The stations that are feeding the matching buffers of an assembly station are referred to as the “subassembly stations.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adan, I., and J. Van Der Wal, 1988, Monotonicity of the Throughput in Single Server Production and Assembly Networks with Respect to the Buffer Sizes, Proc. 1st Int. Workshop, Queueing Networks with Blocking (Perros and Altiok, eds.), North Carolina State Univ., Raleigh, NC.
Altiok, T., and H. G. Perros, 1987, Approximate Analysis of Arbitrary Configurations of Open Queueing Networks with Blocking, Annals of O.R., Vol. 9, pp. 481–509.
Ammar, M. H., and S. B. Gershwin, 1989, Equivalence Relations in Queueing Models of Assembly/Disassembly Networks, Performance Evaluation, Vol. 10, pp. 233–245.
Avi-Itzhak, B., and S. Halfin, 1991 a, Non-Preemptive Priorities in Simple Fork-Join Queues, Queueing, Performance and Control in ATM,ITC-13 (Cohen and Pack, eds.). Elsevier Science Publishers, New York.
Avi-Itzhak, B., and S. Halfin, 1991b, Priorities in Simple Fork-Join Queues, RUTCOR Research Report No. 32–91, Rutgers University, Piscataway, New Jersey.
Baccelli, F., and A. M. Makowski, 1985, Simple Computable Bounds for the Fork-Join Queue, Proc. 19th Ann. Conf. Inform. Sci. and Systems, The Johns Hopkins University Press, Baltimore, MD, pp. 436–441.
Baccelli, F., A. M. Makowski, and A. Schwartz, 1989, The Fork-Join Queue and Related Systems with Synchronization Constraints: Stochastic Ordering, Approximations and Computable Bounds, Adv. Appl. Prob., Vol. 21, pp. 629–660.
Baccelli, F., W. A. Massey, and D. Towsley, 1989, Acyclic Fork-Join Queueing Networks, J. Assoc. Comp. Mach., Vol. 36. pp. 629–660.
Bhat, U. N., 1986, Finite-Capacity Assembly-Like Queues, Queueing Systems, Vol. 1, pp. 85–101.
Cooper, R. B., 1990, Introduction to Queueing Theory, 3rd edition, Ceep Press, Washington, DC.
Crane, M. A., 1974, Multi-Server Assembly Queues, J. Appl. Prob., Vol. 11, pp. 629— 632.
Dallery, Y., Z. Liu, and D. Towsley, 1991, Equivalence, Reversibility, Symmetry, and Concavity in Fork/Join Queueing Networks with Blocking, To Appear in JACM.
De Koster, M. G. M., 1987, Approximation of Assembly/Disassembly Systems, Rep. BDK ORS-87–02, Dept. of IE, Eindhoven University of Tech., The Netherlands.
Di Mascolo, M., R. David, and Y. Dallery, 1991, Modeling and Analysis of Assembly Systems with Unreliable Machines and Finite Buffers, IIE Transactions, Vol. 23, pp. 315–331.
Flatto, L., and S. Hahn, 1984, Two Parallel Queues Created by Arrivals with Two Demands I, Siam J. Appl. Math., Vol. 44, pp. 1041–1053.
Gershwin, S. B., 1991, Assembly/Disassembly Systems: An Efficient Decomposition Algorithm for Tree-Structured Networks, IIE Transactions, Vol. 23, pp. 302–314.
Harrison, J. M., 1973, Assembly-Like Queues, J. Appl. Prob., Vol. 10, pp. 354–367.
Jun, K. P. and H. G. Perros, 1988, Approximate Analysis of Arbitrary Configurations of Queueing Networks with Blocking and Deadlock, Proc. 1st Int. Workshop, Queueing Networks With Blocking (Perros and Altiok, eds.), North Carolina State Univ.
NC. Kashyap, and B. R. K. Kerbache, 1965, A Double Ended Queueing System with Limited Waiting Space, Proc. of Natl. Inst. Sci. India, A31, pp. 559–570.
Kerbache, L., and J. M. Smith, 1987, The Generalized Expansion Method for Open Finite Queueing Networks, E. J. Oper. Res, Vol. 32, pp. 448–461.
Konstantopoulos, P., and J. Walrand, 1989, Stationary and Stability of Fork-Join Networks, J. Appl. Prob., Vol. 26, pp. 604–614.
Latouche, G. 1981, Queues with Paired Customers, J. Appl. Prob.. Vol. 18, pp. 684–696.
Lee, H., and S. M. Pollock, 1990, Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking, Operations Research, Vol. 38, pp. 1123–1134.
Lipper, E. H., and B. Sengupta, 1986, Assembly-Like Queues with Finite Capacity: Bounds, Asymptotics and Approximations, Queueing Systems, Vol. 1, pp. 67–83.
Liu, X. G., 1990, Toward Modeling Assembly Systems: Applications of Queueing Networks with Blocking, Ph.D. Thesis, University of Waterloo, Waterloo, Ontario.
Mendelbaum, M., and B. Avi-Itzhak, 1968, Introduction to Queueing with Splitting and Matching, Isr. J. Tech., Vol. 6, pp. 376–382.
Nelson, R., and A. N. Tantawi, 1988, Approximate Analysis Fork/Join Synchronization in Parallel Queues, IEEE Transactions, Vol. 37, pp. 739–743.
Neuts, M. F., 1981, Matrix-Geometric Solutions in Stochastic Models-An Algorithmic Approach, The Johns Hopkins University Press, Baltimore, MD.
Rao, B. M., and M. J. M. Posner, 1985, Algorithmic and Approximation Analysis of the Split and Match Queue, Stochastic Models, Vol. 1, pp. 433–456.
Sengupta, B., 1989, On Modeling the Store of an Assembly Shop by Due Date Processes, Operations Research, Vol. 37, pp. 437–448.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Altiok, T. (1997). Assembly Systems. In: Performance Analysis of Manufacturing Systems. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1924-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1924-8_6
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7341-7
Online ISBN: 978-1-4612-1924-8
eBook Packages: Springer Book Archive