|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Single Machine Scheduling With a Generalized Total Tardiness Objective Functionкнига
- Авторы: Гафаров Е.Р., Лазарев А.А., Werner F.
- Год издания: 2010
- Место издания: Otto-von-Guericke Universitaet Magdeburg, Germany
- Объём: 8 страниц
- Аннотация: In this note, we consider a single machine scheduling problem with generalized total tardiness objective function. An NP-hardness proof and a pseudo-polynomial time solution algorithm are proposed for a special case of this problem. Moreover, we present a new graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number of tardy jobs on a single machine. The latter algorithm improves the complexity of an existing pseudo-polynomial algorithm by Lawler.
- Добавил в систему: Лазарев Александр Алексеевич