No label defined (Q4242389)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1285632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1285632 |
Statements
10 May 1999
0 references
scheduling theory
0 references
polynomial algorithm
0 references
minimization
0 references
combinatorial complexity
0 references
0.8080304861068726
0 references
0.8043773770332336
0 references
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.
0 references
