TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING WITH JOB PRIORITY WEIGHTS BY HEURISTIC’S EFFICIENT JOB ORDER INPUT
Background. In setting a problem of minimizing total weighted 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 sche...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Igor Sikorsky Kyiv Polytechnic Institute
2021-03-01
|
| سلاسل: | KPI Science News |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://scinews.kpi.ua/article/view/209129 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|