Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.

Keywords

Data Structures and Algorithms, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/97946

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0412094
 http://arxiv.org/abs/cs/0412094

Collections

arXiv