scientific article; zbMATH DE number 1285632

From MaRDI portal
Publication:4242389





Parametric problems of the scheduling theory are considered. All works are executed on a single machine. The duration of every work is proportional to some function. The value of the function depends on the time of the beginning of the execution of a given work. Several optimality criteria are studied: minimization of the total time of execution of all works, minimization of a weighted sum of times of ending of all works, etc. Combinatorial complexity of the problems is studied. Conditions on functions are found which are sufficient for existence of precise polynomial algorithms.




Cited in
(19)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242389)