Preemptive scheduling of two uniform parallel machines to minimize total tardiness |
| |
| Authors: | Irina N. Lushchakova |
| |
| Affiliation: | Belarusian State University of Informatics and Radioelectronics 6, P. Brovka St., Minsk 220013, Republic of Belarus |
| |
| 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. |
| |
| Keywords: | Scheduling Uniform machines Total tardiness Polynomial algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
