One-Machine Scheduling To Minimize Mean Tardiness With Minimum Number Tardy
In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed o...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , , |
| التنسيق: | article |
| منشور في: |
2020
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/1990/1/one_machine_scheduling_to_minimize_mean__duffuaa_isi_a1997wv66000004.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this paper the one-machine scheduling problem with the objective of minimizing the mean tardiness subject to maintaining a prescribed number of tardy jobs is analysed An algorithm for solving this problem is presented. It is proved that the schedule generated by the proposed algorithm is indeed optimal. |
|---|