| Title: | Preemptive scheduling of two uniform parallel machines to minimize total tardiness |
| Authors: | Lushchakova, I. N. |
| Keywords: | публикации ученых;polynomial algorithm;scheduling;total tardiness;uniform machines;due dates;polynomial algorithm;pre-emptive scheduling;total tardiness;uniform machine;uniform parallel machines;mathematical models;operations research;scheduling;scheduling algorithms |
| Issue Date: | 2012 |
| Publisher: | БГУИР |
| Citation: | Lushchakova, I. N. Preemptive scheduling of two uniform parallel machines to minimize total tardiness / I. N. Lushchakova // European Journal of Operational Research. – 2012. – Volume 219, Issue 1. – Р. 27–33. |
| Abstract: | We consider the problem of preemptive scheduling n jobs on two uniform parallel machines. All jobs have equal processing requirements. For each job we are given its due date. The objective is to find a schedule minimizing total tardiness ∑ Ti. We suggest an O(n log n) algorithm to solve this problem. |
| URI: | https://libeldoc.bsuir.by/handle/123456789/7813 |
| DOI: | https://doi.org/10.1016/j.ejor.2011.11.023 |
| Appears in Collections: | Публикации в зарубежных изданиях
|
