Abstract
In this paper we study the problem of minimizing the expected number of jobs in a single class general open queueing network model of a job shop. This problem was originally posed by Buzacott and Shanthikumar [2] and solved by them for a special case. We extend their work in this paper. We derive feasibility conditions that simplify the analysis of the problem. We show that the optimal configuration can be completely characterized when both the utilizations of the machine centers are high and there are a large number of servers at each machine center. We also derive conditions under which the optimization problem reduces to solving a concave or a convex program and provide conditions under which the uniform flow line and the symmetric job shop (or variants of these) are optimal configurations for the job shop.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems (Prentice–Hall, Englewood Cliffs, NJ, 1993).
J.A. Buzacott and J.G. Shanthikumar, Design of manufacturing systems using queueing models, Queueing Systems 12 (1992) 135–214.
D.J. Daley and D. Vere–Jones, An Introduction to the Theory of Point Processes (Springer, New York, 1988).
B.V. Gnedenko and I.N. Kovalenko, Introduction to Queueing Theory, 2nd ed. (Birkhäuser, Boston, 1989).
P.R. Kumar, Reentrant lines, Queueing Systems 13 (1993) 87–110.
D.G. Luenberger, Introduction to Dynamic Systems: Theory Models and Applications (Wiley, New York, 1979).
M. Padberg, Linear Optimization and Extensions (Springer, Berlin, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Giloni, A., Seshadri, S. Optimal Configurations of General Job Shops. Queueing Systems 39, 137–155 (2001). https://doi.org/10.1023/A:1012792400555
Issue Date:
DOI: https://doi.org/10.1023/A:1012792400555