×

An aggregation procedure for simulating manufacturing flow line models. (English) Zbl 0888.90082

Summary: We develop a formal method for specifying an aggregate discrete-event simulation model of a production flow line manufacturing system. The methodology operates by aggregating production stations or resources of a flow line. Determining the specifications for representing the aggregated resources in a simulation model is the focus of our presentation. We test the methodology for a set of flow lines with exponentially distributed arrival and service times. Comparisons between analytical and simulation results indicate the aggregation approach is quite accurate for estimating average part cycle time.

MSC:

90B30 Production models
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Pegden, C. D.; Shannon, R. E.; Sadowski, R. P., Introduction to Simulation Using SIMAN (1995), McGraw-Hill Inc: McGraw-Hill Inc New York
[2] Zeigler, B., Hierarchical modular modeling/knowledge representation, (SCS 1986 Winter Simulation Conference (1986)), 129-137
[3] Zeigler, B. P., Hierarchical, modular discrete-event modelling in an object-oriented environment, Simulation, 49, 219-230 (1987)
[4] Portier, F. J., Implementing the product automaton formalism, (SCS 1987 Winter Simulation Conference (1987)), 544-553
[5] Overstreet, C. M.; Nance, R. E., A specification language to assist in analysis of discrete event simulation models, Communications of the ACM, 28, 190-201 (1985)
[6] Derrick, E. J.; Balci, O.; Nance, R., A comparison of selected conceptual frameworks for simulation modeling, (SCS 1989 Winter Simulation Conference (1989)), 711-718
[7] Rogers, D. F.; Plante, R. D.; Wong, R. T.; Evans, J. R., Aggregation and disaggregation techniques and methodology in optimization, Operations Research, 39, 553-582 (1991) · Zbl 0729.90738
[8] Friedman, H. D., Reduction methods for tandem queuing systems, Operations Research, 13, 121-131 (1965) · Zbl 0143.40702
[9] Gershwin, S. B., An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking, Operations Research, 35, 291-305 (1987) · Zbl 0626.90027
[10] Gershwin, S. B., An efficient decomposition algorithm for unreliable tandem queueing systems with finite buffers, (Perros, H. G.; Altiok, T., Queueing Networks with Blocking (1989), North-Holland), 127-146
[11] Takahashi, Y., Aggregate approximation for acyclic queueing networks with communication blocking, (Perros, H. G.; Altiok, T., Queueing Networks with Blocking (1989), North-Holland), 33-46
[12] Schweitzer, P. J.; Altiok, T., Aggregate modelling of tandem queues without intermediate buffers, (Perros, H. G.; Altiok, T., Queueing Networks with Blocking (1989), North-Holland), 47-72
[13] Hunt, G. C., Sequential arrays of waiting lines, Operations Research, 4, 674-683 (1956) · Zbl 1414.90106
[14] Hillier, F. S.; Boling, R. W., Finite queues in series with exponential or Erlang service times — A numerical approach, Operations Research, 15, 286-303 (1967) · Zbl 0171.16302
[15] Altiok, T., Approximate analysis of exponential tandem queues and blocking, European Journal of Operations Research, 11, 390-398 (1982) · Zbl 0497.60096
[16] Gun, L.; Makowski, A. M., An approximation method for general tandem queueing systems subject to blocking, (Perros, H. G.; Altiok, T., Queueing Networks with Blocking (1989), North-Holland), 147-174
[17] Cheng, T. C.E., Analysis of material flow in a job shop with assembly operations, International Journal of Production Research, 28, 1369-1383 (1990)
[18] Mott, J.; Tumay, K., Developing a strategy for justifying simulation, Industrial Engineering, 24, 38-42 (1992)
[19] Aneke, N. A.G.; Carrie, A. S., A comprehensive flowline classification scheme, International Journal of Production Research, 22, 281-297 (1984)
[20] Altiok, T., Approximate analysis of queues in series with phase-type service time and blocking, Operations Research, 37, 601-610 (1989) · Zbl 0674.90030
[21] Brandwajin, A.; Jow, Y. L., An approximation method for tandem queues with blocking, Operations Research, 36, 73-83 (1988) · Zbl 0643.90026
[22] Graves, S. C., A tactical planning model for a job shop, Operations Research, 34, 522-533 (1986) · Zbl 0609.90061
[23] Hillier, F. S.; Boling, R. W., The effect of some design factors on the efficiency of production lines with variable operation times, Journal of Industrial Engineering, 17, 651-658 (1966)
[24] Konig, D.; Schmidt, V., Relationship between time/customer stationary characteristics of tandem queues attended by a single server, Journal of the Operations Research Society of Japan, 27, 191-204 (1984) · Zbl 0554.60089
[25] Ku, P. S.; Niu, S. C., On Johnson’s two-machine flow shop with random processing times, Operations Research, 34, 130-136 (1986) · Zbl 0595.90044
[26] Hendricks, K. B., The output processes of serial production lines of exponential machines with finite queues, Operations Research, 40, 1139-1147 (1992) · Zbl 0825.90522
[27] Lee, Y. J.; Zipkin, P., Tandem queues with planned inventories, Operations Research, 40, 936-947 (1992) · Zbl 0758.90025
[28] Maaloe, E., Approximations formulae for estimation of waiting-time in multiple-channel queueing system, Management Science, 19, 703-710 (1973) · Zbl 0252.60043
[29] McCormick, S. T.; Pinedo, M. L.; Shenker, S.; Wolf, B., Sequencing in an assembly line with blocking to minimize cycle time, Operations Research, 37, 925-935 (1989) · Zbl 0689.90048
[30] Pinedo, M., Minimizing the expected makespan in stochastic flow shops, Operations Research, 30, 148-162 (1982) · Zbl 0481.90047
[31] Shalmon, M.; Kaplan, M. A., A tandem network of queues with deterministic service and intermediate arrivals, Operations Research, 32, 753-773 (1984) · Zbl 0553.90041
[32] Suresh, S.; Whitt, W., Arranging queues in series: A simulation experiment, Management Science, 36, 1080-1091 (1990)
[33] Wittrock, R. J., An adaptive scheduling algorithm for flexible flow lines, Operations Research, 36, 445-453 (1988) · Zbl 0646.90039
[34] Whitt, W., Comparison conjectures about the M/G/S queue, Operations Research Letters, 2, 203-209 (1983) · Zbl 0527.60085
[35] Whitt, W., Departures from a queue with many busy servers, Mathematics of Operations Research, 9, 534-544 (1984) · Zbl 0553.90044
[36] Wolff, R. W., Tandem queues with dependent service times in light traffic, Operations Research, 30, 619-635 (1982) · Zbl 0485.90041
[37] Savory, P. A., A robust aggregation approach to simplification of manufacturing flow line models, (Ph.D. Dissertation (1993), Arizona State University)
[38] Burke, P. J., The output of a queueing systems, Operations Research, 4, 699-704 (1956) · Zbl 1414.90097
[39] Pritsker, A. A.B., Introduction to Simulation and Slam II (1986), Systems Publishing Corporation: Systems Publishing Corporation West Lafayette, IN
[40] Kronmal, R. A.; Peterson, A. V., On the alias method for generating random variables from a discrete distribution, The American Statistician, 33, 214-218 (1979) · Zbl 0421.65001
[41] Law, A. M.; Kelton, W. D., Simulation Modeling and Analysis (1991), McGraw Hill: McGraw Hill New York
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.