EFFICIENT EXACT MINIMIZATION OF TOTAL TARDINESS IN TIGHT-TARDY PROGRESSIVE SINGLE MACHINE SCHEDULING WITH IDLING-FREE PREEMPTIONS OF EQUAL-LENGTH JOBS
Background. A schedule ensuring the exactly minimal total tardiness can be found with the respective integer linear programming problem. An open question is whether the exact schedule computation time changes if the job release dates are input to the model in reverse order. Objective. The goal is to...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Igor Sikorsky Kyiv Polytechnic Institute
2020-03-01
|
| Серии: | KPI Science News |
| Предметы: | |
| Online-ссылка: | http://scinews.kpi.ua/article/view/180877 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|