×

Determining buffer location and size in production lines using tabu search. (English) Zbl 0991.90046

Summary: We address the problem of buffer location and storage size in a manufacturing line. A simulation-search heuristic procedure based on tabu search, combined with simulation, was developed and tested. Simulation is used to model the manufacturing process and tabu search is used to guide the search to overcome the problem of being trapped at local optimal solutions. The procedure employs a swap search routine and a global search routine. With the swap search routine, the procedure identifies good performing buffer profiles and determines the maximum output level for any given storage level. With the global search routine, the procedure can locate promising neighborhood of buffer profiles quickly. The results obtained are then used to plot a line specific output curve. The procedure is capable of modeling a variety of manufacturing processes with a variety of scheduling policies and dispatching rules.

MSC:

90B30 Production models
90B05 Inventory, storage, reservoirs

Software:

Tabu search
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Buzacott, J. A., Automatic transfer lines with buffer stocks, International Journal of Production Research, 5, 3, 183-200 (1967)
[2] Buzacott, J. A., The role of inventory banks in flow-line production systems, International Journal of Production Research, 9, 4, 425-436 (1971)
[3] Chow, W., Buffer capacity analysis for sequential production lines with variable process times, International Journal of Production Research, 25, 8, 1183-1196 (1987)
[4] Conway, R.; Maxwell, W.; McClain, J. O.; Thomas, L. J., The role of work-in-process inventory in serial production lines, Operations Research, 36, 2, 229-241 (1988)
[5] Glover, F., Heuristics for integer programming using surrogate constraints, Decision Sciences, 8, 1, 156-166 (1977)
[6] Glover, F., Future paths for integer programming and links to artificial intelligence, Computers and Operations Research, 13, 5, 533-549 (1986) · Zbl 0615.90083
[7] Glover, F., Tabu search — part I, ORSA Journal on Computing, 1, 3, 190-206 (1989) · Zbl 0753.90054
[8] Glover, F., Tabu search — part II, ORSA Journal on Computing, 2, 1, 4-32 (1989) · Zbl 0771.90084
[9] Glover, F., Artificial intelligence, heuristic frameworks and tabu search, Managerial and Decision Economics, 11, 5, 365-375 (1990)
[10] Glover, F.; Laguna, M., Tabu Search (1997), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht · Zbl 0930.90083
[11] Glover, F.; McMillan, C.; Novick, B., Interactive decision software and computer graphics for architectural and space planning, Annals of Operations Research, 5, 6, 557-583 (1985)
[12] Glover, F.; Taillard, E.; de Werra, D., A user’s guide to tabu search, Annals of Operations Research, 41, 3-28 (1993) · Zbl 0772.90063
[13] Hansen, P., The steepest ascent mildest descent heuristic for combinatorial programming, (Presented at the Congress on Numerical Methods in Combinatorial Optimization. Presented at the Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986))
[14] Hendricks, K. B., The output processes of serial production lines of exponential machines with finite buffers, Operations Research, 40, 6, 1139-1147 (1992) · Zbl 0825.90522
[15] Hendricks, K. B.; McClain, J. O., The output processes of serial production lines of general machines with finite buffers, Management Science, 39, 10, 1194-1201 (1993)
[16] Hertz, A.; de Werra, D., The tabu search metaheuristic: how we used it, Annals of Mathematics and Artificial Intelligence, 1, 111-121 (1990) · Zbl 0878.68053
[17] Hillier, F. S.; Boling, R. W., The effects of some design factors on the efficiency of production lines with variable operation times, Journal of Industrial Engineering, 17, 12, 651-658 (1966)
[18] Hillier, F. S.; Boling, R. W., Finite queues in series with exponential or Erlang service times - a numerical approach, Operations Research, 15, 2, 286-303 (1967) · Zbl 0171.16302
[19] Hillier, F. S.; So, K. C., The effect of machine breakdowns and interstage storage on the performance of production line systems, International Journal of Production Research, 29, 10, 2043-2055 (1991) · Zbl 0729.90575
[20] Hillier, F. S.; So, K. C.; Boling, R. W., Notes: toward characterizing the optimal allocation of storage space in production line systems, Management Science, 39, 1, 126-133 (1993)
[21] Ho, Y. C.; Eyler, M. A.; Chien, T. T., A gradient technique for general buffer storage design in a production line, International Journal of Production Research, 17, 6, 557-580 (1979)
[22] Hunt, G. C., Sequential arrays of waiting lines, Operations Research, 4, 6, 674-683 (1956) · Zbl 1414.90106
[23] Jafari, M. A.; Shanthikumar, J. G., Determination of optimal buffer storage capacities and optimal allocation in multistage automatic transfer lines, IEE Transactions, 21, 2, 130-135 (1989)
[24] Lambrecht, M.; Segaert, A., Buffer stock allocation in serial and assembly type production lines, International Journal of Operations and Production Management, 10, 2, 47-61 (1990)
[25] Lutz, C. M., Determination of buffer size and location in scheduling systems, (Ph.D. Dissertation (1995), Terry College of Business, The University of Georgia at Athens, GA)
[26] Park, T., A two-phase heuristic algorithm for determining buffer sizes of production lines, International Journal of Production Research, 31, 3, 613-631 (1993)
[27] Powell, S. G.; Pyke, D. F., Allocation of buffers to serial production lines with bottlenecks, IEE Transactions, 28, 1, 18-29 (1996)
[28] (SLAMSYSTEM User’s Guide (1988)), West Lafayette, Indiana, USA
[29] Soyster, A. L.; Schmidt, J. W.; Rohrer, M. W., Allocation of buffer capacities for a class of fixed production lines, AIIE Transactions, 11, 2, 140-146 (1979)
[30] Sun, M., A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints, Journal of Heuristics (1998), forthcoming · Zbl 0903.90120
[31] Sun, M.; Aronson, J. E.; McKeown, P. G.; Drinka, D., A tabu search heuristic procedure for the fixed charge transportation problem, European Journal of Operational Research, 106, 1998, 441-456 (1998) · Zbl 0991.90010
[32] Sun, M.; McKeown, P. G., Tabu search applied to the general fixed charge problem, Annals of Operations Research, 41, 1-4, 405-420 (1993) · Zbl 0775.90287
[33] Yamazaki, G.; Sakasegawa, H., Properties of duality in tandem queuing systems, Annals of the Institute of Statistical Mathematics, 27, 3, 201-212 (1975) · Zbl 0374.60125
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.