| Autor: |
Shulgina, O., Shcherbakova, N. |
| Zdroj: |
Lobachevskii Journal of Mathematics; Apr2015, Vol. 36 Issue 2, p211-214, 4p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink