Abstract
This paper is devoted to a class of problems for which there exist optimal structure schedulings. One presents the solutions of two problems of scheduling theory. One analyzes the similarities and the differences in the formulation between the problems of this class and the traditional problems of scheduling theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, the Hague (1976).
J. K. Lenstra, Sequencing by Enumerative Methods, Math. Centrum, Amsterdam (1977).
J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, “Complexity of machine scheduling problems,” Ann. Discrete Math.,1, 343–362 (1977).
K. V. Shakhbazyan, “The ordering of the structural set of jobs, minimizing the total penalty,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,90, 229–264 (1979).
V. S. Ganaev and V. V. Shkurba, Introduction in the Theory of Scheduling [in Russian], Nauka, Moscow (1975).
E. L. Lawler, “On scheduling problems with deferral costs,” Manage. Sci.,11, No. 2, 280–288 (1964).
K. V. Shakhbazyan, “On scheduling theory problems of type n¦1¦ σci(t),” J. Sov. Math.,22, No. 2 (1983).
K. V. Shakhbazyan and N. B. Lebedinskaya, “On optimal scheduiings with gaps for independent jobs in a service system with N servers,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst.,70, 205–231 (1977).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 102, pp. 138–146, 1980.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V. Structural schedulings in the problems of scheduling theory. J Math Sci 22, 1248–1253 (1983). https://doi.org/10.1007/BF01460277
Issue Date:
DOI: https://doi.org/10.1007/BF01460277