|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
A Polynomial Time Graphical Algorithm for Maximizing Total Tardiness on a Single Machineкнига
- Авторы: Гафаров Е.Р., Лазарев А.А., Werner F.
- Год издания: 2010
- Место издания: Otto-von-Guericke Universitaet Magdeburg Magdeburg, Germany
- Объём: 15 страниц
- Аннотация: In this paper, we consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed. We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time.
- Добавил в систему: Лазарев Александр Алексеевич