Buffer allocation for an integer nonlinear network design problem

Computers and Operations Research

Volumn 24, Issue 5, 1997, Pages 453-472

  Singh, Ajay ^a   MacGregor Smith, J ^b  

^a United Airlines Executive Offices   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; CIRCUIT THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMIZATION; QUEUEING THEORY; RANDOM PROCESSES;

BUFFER ALLOCATION PROBLEM (BAP);

STORAGE ALLOCATION (COMPUTER);

EID: 0031144486     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(96)00068-8     Document Type: Article

References (48)

1. Altlok, T. and Stidham, S., The allocation of interstage buffer capacities in production lines. IIE Transactions, 1983, 15, 251-261.
2. MacGregor Smith, J. and Daskalaki, S., Buffer space allocation in automated assembly lines. Oper. Res., 1988, 36(2), 343-358.
3. MacGregor Smith, J. and Chikhale, N., Buffer Allocation for a class of Nonlinear Stochastic Knapsack Problems. Ann. Oper. Res., 1995, 58, 323-360.
4. Yamashita, H. and Suzuki, S., An Approximate Solution Method for Optimal Buffer Allocation in Serial n-stage Automatic Production Lines (in Japanese). Trans. Japan Soc. Mech. Engin. 53-C, 1987, 807-814.
5. Yamashita, H. and Altiok, T., Buffer Capacity Allocation for a Desired Throughput in Production Lines, Working Paper, Department of Mechanical Engineering, Sophia University, Tokyo, Japan, 1995.
6. Kerbache, L. and MacGregor Smith, J., The generalized expansion method for open finite queueing networks. Eur. J. Oper. Res., 1987, 32, 448-461.
7. Onvural, R., Survey of Closed Queueing Networks with Blocking. ACM Computing Surveys, 1990, 22, 2 83-121.
8. Kerbache, L. and MacGregor Smith, J., Asymptotic behaviour of the expansion method for open finite queueing networks. Comp. Oper. Res., 1988, 15(2), 157-169.
9. Labetoulle, J. and Pujolle, G., Isolation method in a network of queues. IEEE Trans. on Software Engineering, 1980, 6(4), 373-381.
10. Kleinrock, L., Queueing Systems, Volume I: Theory. Wiley, first edition, 1975.
11. Bell, P. C., The use of decomposition techniques for the analysis of open restricted queueing networks. Ops Res. Letts, 1982, 1(6), 230-235.
12. Takahashi, Y., Miyahara, H. and Hasegawa, T., An approximation method for open restricted queueing networks. Oper. Res., 1980, 28(3), 594-602.
13. Hillier, F. S. and Boling, R. W., Finite queues in series with exponential or erlang service times-a numerical approach. Oper. Res., 1967, 15, 286-303.
14. Boxma, O. and Konheim, A., Approximate analysis of exponential queueing systems with blocking. Acta Informat., 1981, 15, 19-26.
15. Singh, A. J., A System for Topological Network Design of Queueing Systems with MultiServer Queues. Masters Thesis. Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA 01003, 1993.
16. Powell, M. J. D., An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J., 1964, 7, 155-162.
17. Dixon, L.C.W., Nonlinear Optimisation. The English Universities Press Limited, 1972.
18. Altiok, T. and Perros, H.G., Open networks for queues with blocking: Split and merge configurations. IIE Transactions, 1986, pp. 251-261.
19. Baker, K. R., Powell, S. G. and Pyke, D. F., Buffered and Unbuffered Assembly Systems with Variable Processing Times. J. Mfg. Oper. Mgmt., 1990, 3, 200-223.
20. Brandwajn, A. and Jow, Y., An approximation method for tandem queues with blocking. Oper. Res., 1988, 36, 73-83.
21. Caseau, P. and Pujolle, G., Throughput capacity of a sequence of queues with blocking due to finite waiting room. IEEE Transactions on Software Engineering SE-5, 1979, pp. 631-642.
22. Cheah., J., State dependent queueing models. M.S. Thesis, Dept of Ind. Eng., Univ. of Massachusetts, Amherst, MA 01003, 1990.
23. Conway, R., Maxwell, W. L., McClain, J. O. and Thomas, L. J., The Role of Work-in-process Inventories in Serial Production Lines. Oper. Res., 1988, 36, 229-241.
24. Fredericks, A. A., Congestion in blocking systems - a simple approximation technique. The Bell System Technical J., 1980, 59(6), 805-827.
25. Gelenbe, E. and Pujolle, G., The behavior of a single queue in a general queueing network. Acta Informat., 1976, 7, 123-136.
26. Gosavi, H. and MacGregor Smith, J., Heavy traffic multi-commodity routing in open finite queueing networks, Tech Report, Dept of Ind. Eng., Univ. of Massachusetts, Amherst, MA 01003, 1990.
27. Gross, D. and Harris, C., Fundamentals of Queueing Theory, Wiley, New York, 1985.
28. Han, Y. and MacGregor Smith, J., Approximate analysis of M/M/C/K queueing networks, Queueing Networks with Finite Capacity, eds. R. O. Onvural and I. F. Akylldiz, Elsevier Science, 1993, pp. 113-126.
29. Hillier, F. and So, K., The Effect of the Coefficient of Variation of Operation Times on the Allocation of Storage Space in Production Line Systems, IIE Trans. 23-2, 1991, pp. 198-206.
30. Ho, Y. C., Eyler, M. A. and Chien, T. T., A Gradient Technique for General Buffer Storage Design in a Production Line. Int. J. of Prod. Res., 1979, 17, 557-580.
31. Jafari, M. A. and Shantikumar, J. G., Determination of Optimal Buffer Storage Capacities and Optimal Allocation in Multisatage Automatic Transfer Lines. IIE Trans., 1989, 21, 130-135.
32. Jain, S. and MacGregor Smith, J., Open finite queueing networks with M/M/C/K parallel servers. Comp. Oper. Res. , 1994, 21, 3 297-317.
33. Jain, S., Optimization of queueing networks with parallel servers. M.S. Thesis, Dept of Ind. Eng., Univ. of Massachusetts, Amherst, MA 01003, 1989.
34. Kubat, P. and Sumita, U., Buffers and Backup Machines in Automatic Transfer Lines. Int. J. Prod. Res., 1985, 23-6, 1259-1280.
35. Kuehn, P. J., Approximate analysis of general queueing networks by decomposition. IEEE Trans. on COMM, 1979, 27, 113-126.
36. Perros, H. G. and Altiok, T., Approximate analysis of open networks of queues with blocking: Tandem configurations. IEEE Transactions on Software Engineering, 1986, SE-12(3), 450-461.
37. Powell, S. G., Buffer Allocation in Unbalanced Serial Lines, Working Paper #289, Amos Tuck School of Business Administration, Dartmouth College, Hanover, N.H. 03755, 1992.
38. Rue, R. C. and Rosenshine, M., Some properties of optimal control policies for entries to an m/m/1 queue. Naval Research Logistics Quarterly, 1981, 13, 447-476.
39. Schweitzer, P. and Altiok, T., Aggregate Modelling of Tandem Queues without Intermediate Buffers. In Queueing Networks with Blocking, eds H. Perros and T. Altiok. North-Holland, Amsterdam, 1989, pp. 47-72.
40. Seong, D., Chang, S. Y. and Hong, Y., Heuristic Algorithms for Buffer Allocation in a Production Line with Unreliable Machines, Working Paper, Management Sciences Research Laboratory, Pohang Korea, 1994.
41. MacGregor Smith, J., State dependent queueing models in emergency evacuation networks. Transportation Research-B, 1991, 25-B, 373-389.
42. MacGregor Smith, J., Graves, R. J. and Kerbache, L., Qnet: An open queueing network model for material handling system analysis. Mater. Flow, 1986, 3, 225-242.
43. MacGregor Smith, J. and Rouse, W. B., Application of queueing network models to optimization of resource allocation within libraries. J. Am. Soc. Information Sci. , 1979, 30(5), 250-263.
44. Soyster, A. L., Schmidt, W. J. and Rohrer, M. W., Allocation of Buffer Capacities for a Class of Fixed Cycle Production Lines. AIIE Trans., 1979, 11, 140-146.
45. Takahashi, Y., Aggregate Approximation for Acyclic Queueing Networks with Communication Blocking. In Queueing Networks with Blocking, eds H. Perros and T. Altiok. North-Holland, Amsterdam, 1989, pp. 33-46.
46. VanDijk, N. and Lamond, B., Simple bounds for finite single server exponential tandem queues. Oper. Res., 1988, 36, 470-477.
47. VanDijk, N. and van der Wal, J., Simple bounds and monotonicity results for finlite multi-server exponential tandem queues. Queueing Systems, 1989, 4(1), 1-16.
48. Yamashita, H. and Onvural, R., Allocation of Buffer Capacities in Queueing Networks with Arbitrary Topologies, Working Paper, Department of Mechanical Engineering, Sophia University, Tokyo, Japan, 1992.