TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING BY HEURISTIC’S EFFICIENT JOB ORDER INPUT
Background. In setting a problem of minimizing total tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input the data: the job release dates are given in either ascending or descending order. It was recently ascertained that scheduling a f...
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Igor Sikorsky Kyiv Polytechnic Institute
2020-08-01
|
| Серии: | KPI Science News |
| Предметы: | |
| Online-ссылка: | http://scinews.kpi.ua/article/view/199850 |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|