Abstract
The class of problems n¦1∥σci(t) is considered for special sets of penalty functions ci(t). Using the structural properties of the sets of functions ci(t), one selects subclasses of problems which possess a polynomial complexity.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
J. K. Lenstra, Sequencing by Enumerative Methods, Math. Centrum, Amsterdam (1977).
A. H. G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity and Computations, Nijhoff, the Hague (1976).
J. M. Moore, “An n job, one machine sequencing algorithm for minimizing the number of late jobs,” Manage. Sci.,15, No. 1, 102–109 (1968).
E. L. Lawler and J. M. Moore, “A functional equation and its application to resource allocation and sequencing problems,” Manage. Sci.,16, No. 1, 77–84 (1969).
W. E. Smith, “Various optimizers for single-stage production,” Naval. Res. Logist. Q.,3, 59–66 (1956).
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).
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading (1974).
K. V. Shakhbazyan, “Structural schedulings in the problems of scheduling theory,” J. Sov. Math.,22, No. 2 (1983).
E. L. Lawler, “On scheduling problems with deferral costs,” Manage. Sci.,11, No. 2, 280–288 (1964).
Additional information
Translated irom Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 102, pp. 147–155, 1980.
Rights and permissions
About this article
Cite this article
Shakhbazyan, K.V. Scheduling theory problems of type n¦1∥σci(t). J Math Sci 22, 1254–1259 (1983). https://doi.org/10.1007/BF01460278
Issue Date:
DOI: https://doi.org/10.1007/BF01460278