Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-28T14:22:10.307Z Has data issue: false hasContentIssue false
  • English
  • Français

Ordering of Tandem Constant-Service Stations to Minimize In-Process Stock Cost

Published online by Cambridge University Press:  27 July 2009

Janice Kim Winch  and
Benjamin Avi-Itzhak
Janice Kim Winch
Affiliation:
Pace University, One Pace Plaza, New York, New York 10038
Benjamin Avi-Itzhak
Affiliation:
RUTCOR, Rutgers University, P.O. Box 5062, New Brunswick, New Jersey 08903-5062
Get access Rights & Permissions [Opens in a new window]

Abstract

We study tandem ordering of constant-service stations with unlimited buffers where service at each station adds a certain value to the job. With the goal of minimizing the total expect value of the jobs in the system, we provide conditions under which some particular orderings are optimal and describe a heuristic that finds a near-optimal order for stations of arbitrary service lengths and added values.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 9 , Issue 3 , July 1995 , pp. 457 - 473
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Ananlharam, V. (1987). Probabilistic proof of the interchangeability of. /M/1 queues in series. Queueing Systems 2: 387–392.CrossRefGoogle Scholar
2.Avi-Itzhak, B. (1965). A sequence of service stations with arbitrary input and regular service times. Management Science 11: 565–571.CrossRefGoogle Scholar
3.Burke, P.J. (1956). The output of a queueing system. Operations Research 4: 699–704.CrossRefGoogle Scholar
4.Chao, X., Pinedo, M., & Sigman, K. (1989). On the interchangeability and stochastic ordering of exponential queues in tandem with blocking. Probability in the Engineering and Informational Sciences 3: 223–236.CrossRefGoogle Scholar
5.Dattatreya, E.S. (1978). Tandem queueing systems with blocking. Ph.D. dissertation, University of California, Berkeley.Google Scholar
6.Ding, J. & Greenberg, B.S. (1991). Optimal order for servers in series with no queue capacity. Probability in the Engineering and Informational Sciences 5: 449–461.CrossRefGoogle Scholar
7.Friedman, H.D. (1965). Reduction methods for tandem queuing systems. Operations Research 13: 121–131.CrossRefGoogle Scholar
8.Greenberg, B.S. & Wolff, R.W. (1988). Optimal order of servers for tandem queues in light traffic. Management Science 34: 500–508.CrossRefGoogle Scholar
9.Huang, C.C. & Weiss, G. (1990). On the optimal order of M machines in tandem. Operations Research Letters 9: 299–303.CrossRefGoogle Scholar
10.Jackson, J.R. (1957). Networks of waiting lines. Operations Research 5: 518–521.CrossRefGoogle Scholar
11.Jackson, J.R. (1963). Jobshop-like queueing systems. Management Science 10: 131–142.CrossRefGoogle Scholar
12.Lehtonen, T. (1986). On the ordering of tandem queues with exponential servers. Journal of Applied Probability 23: 115–129.CrossRefGoogle Scholar
13.Melamed, B. (1986). A note on the reversibility and duality of some tandem blocking queueing systems. Management Science 32: 1648–1650.CrossRefGoogle Scholar
14.Muth, E.J. (1979). The reversibility property of production lines. Management Science 25: 152–158.CrossRefGoogle Scholar
15.Pinedo, M. (1982). On the optimal order of stations in tandem queues. In Disney, R.L. & Ott, T.J. (eds.), Applied probability-Computer science: The interface. Vol. II. Boston: Birkhauser, pp. 307–325.CrossRefGoogle Scholar
16.Suresh, S. & Whitt, W. (1990). Arranging queues in series: A simulation experiment. Management Science 36: 1080–1091.CrossRefGoogle Scholar
17.Tembe, S.V. & Wolff, R.W. (1972). The optimal order of service in tandem queues. Operations Research 22: 824–832.CrossRefGoogle Scholar
18.Tsoucas, P. & Walrand, J. (1987). On the interchangeability and stochastic ordering of./M/1 queues in tandem. Advances in Applied Probability 19: 515–520.CrossRefGoogle Scholar
19.Weber, R.R. (1979). The interchangeability of tandem./M/1 queues in series. Journal of Applied Probability 16: 690–695.CrossRefGoogle Scholar
20.Weber, R.R. (1992). The interchangeability of tandem queues with heterogeneous customers and dependent service times. Advances in Applied Probability 23: 727–737.CrossRefGoogle Scholar
21.Whitt, W. (1985). The best order for queues in series. Management Science 31: 475–487.CrossRefGoogle Scholar
22.Yamazaki, G. & Sakasegawa, H. (1975). Properties of duality in queueing systems. Annals of the Institute of Statistical Mathematics 27: 201–212.CrossRefGoogle Scholar
23.Yamazaki, G., Sakasegawa, H., & Shanthikumar, J.G. (1992). On optimal arrangement of stations in a tandem queueing system with blocking. Management Science 38: 137–153.CrossRefGoogle Scholar