Abstract
In this paper we proved the new properties optimal schedules for unknown strongly NP-complete scheduling problem of minimizing maximum lateness on a single machine, not allowing preemption. Pseudopolynomial implementation of the general scheme for solving that problem based on these properties is developed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. B. Lebedinskaya, Zap. Nauch. Seminarov Leningrad. Otd. Mat. Inst. Akad. Nauk SSSR, 117–124 (1978).
D. Knut, The art of programming for computers. Vol. 3: Sorting and Searching (Mir, Moscow, 1973) [in Russian].
V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskiy, Scheduling Theory. Single-Stage System (Nauka, Moscow, 1984) [in Russian].
O. N. Shulgina, Avtom. Telemekh. 3, 108 (2004).
O. N. Shulgina, J. Issled. Prikl.Mat. 23, 150 (2001).
O.N. Shulgina, Sbor. Issl. Prikl. Mat. Inform. 25, 148 (2004).
P. Bruker, J. K. Lenstra, and A. H. G. Rinnooy Kan, Ann. Disc.Math. 1, 343 (1977).
W. A. Horn, Nav. Res. Log. Quart. 21, 1, 177 (1974).
B. J. Lageweg, J. K. Lenstra, and A. H. G. Rinnooy Kan, Statist. Neer. 1, 25 (1976).
J. R. Jackson, Res. Report 43, Manag. Sci. Res Project, USLA, Jan. 1955.
G. N. Frederickson, Inform. Process. Lett. 16, 171 (1983).
B. A. Simons, 19th Ann. Symp. Found. Comput. Sci., Ann. Arbor, Mich. New York (1978), p. 246.
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by F. M. Ablayev
Rights and permissions
About this article
Cite this article
Shulgina, O.N., Shcherbakova, N.K. About one algorithm for solving scheduling problem. Lobachevskii J Math 36, 211–214 (2015). https://doi.org/10.1134/S1995080215020171
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080215020171