Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
| dc.creator | Baptiste, Philippe | |
| dc.creator | Chrobak, Marek | |
| dc.creator | Durr, Christoph | |
| dc.creator | Sourd, Francis | |
| dc.date | 2004-12-20 | |
| dc.date.accessioned | 2026-07-07T06:29:12Z | |
| dc.date.available | 2026-07-07T06:29:12Z | |
| dc.description | We study the problem of preemptive scheduling of n equal-length jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. Recently, Brucker and Kravchenko proved that the optimal schedule can be computed in polynomial time by solving a linear program with O(n^3) variables and constraints, followed by some substantial post-processing (where n is the number of jobs.) In this note we describe a simple linear program with only O(mn) variables and constraints. Our linear program produces directly the optimal schedule and does not require any post-processing. | |
| dc.identifier | https://arxiv.org/abs/cs/0412094 | |
| dc.identifier | http://arxiv.org/abs/cs/0412094 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/97946 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2 | |
| dc.title | Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time | |
| dc.type | text |