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...

وصف كامل

التفاصيل البيبلوغرافية
الحاوية / القاعدة:KPI Science News
المؤلف الرئيسي: Vadim V. Romanuke
التنسيق: مقال
اللغة:الإنجليزية
منشور في: Igor Sikorsky Kyiv Polytechnic Institute 2020-03-01
الموضوعات:
Job scheduling
Preemptive single machine scheduling
Exact model
Total tardiness
Computation time
Ascending job order
الوصول للمادة أونلاين:http://scinews.kpi.ua/article/view/180877

الانترنت

http://scinews.kpi.ua/article/view/180877

مواد مشابهة