Abstract
A polynomial-time algorithm, is proposed for constructing a time-optimal schedule for inhomogeneous two-stage queueing systems. These systems are a generalization of most of the two-stage systems considered in queueing theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
S. M. Johnson, “Optimal two- and three-stage production schedules with setup times included,” Naval Res. Logist. Quart.,1, No. 1, 61–68 (1954).
T. Gonzalez and S. Sahni, “Open shop scheduling to minimize finish time,” J. ACM,23, No. 4, 665–679 (1976).
J. R. Jackson, “An extension of Johnson's results on job lot scheduling,” Naval Res. Logist. Quart.,3, No. 3, 201–203 (1956).
T. Masuda, H. Ishii, and T. Nishida, “The mixed shop scheduling problem,” Discr. Appl. Math.,11, No. 2, 175–186 (1985).
M. R. Garey, D. S. Johnson, and R. Sethi, “The complexity of flowshop and jobshop scheduling,” Math. Oper. Res.,1, No. 2, 117–129 (1976).
T. Gonzalez and S. Sahni, “Flowshop and jobshop schedules: complexity and approximation,” Oper. Res.,26, No. 1, 36–52 (1978).
V. S. Tanaev and V. V. Shkurba, An Introduction to Scheduling Theory [in Russian], Nauka, Moscow (1975).
R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy-Kan, “Optimziation and approximation in deterministic scheduling, and sequencing,” Ann. Discr. Math.,5, 287–326 (1979).
Additional information
Translated from Kibernetika, No. 3, pp. 88–94, May–June, 1989.
Rights and permissions
About this article
Cite this article
Strusevich, V.A. Inhomogeneous deterministic two-stage queueing systems. Cybern Syst Anal 25, 391–399 (1989). https://doi.org/10.1007/BF01069997
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069997