Abstract
A generalization of the well-known optimal scheduling problem for jobs with lower and upper deadlines is considered. The existence of structured solutions is proved for a wide class of these problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
K. V. Shakhbazyan and N. B. Lebedinskaya, “On optimal schedules with preemption for independent jobs in an N-server queuing system,” J. Sov. Math.,23, No. 1 (1983).
Additional information
Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 80, pp. 239–248, 1978.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V. Structured solutions in scheduling problems. J Math Sci 28, 440–447 (1985). https://doi.org/10.1007/BF02104314
Issue Date:
DOI: https://doi.org/10.1007/BF02104314