Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines

Authors:
Irina N. Lushchakova
Affiliations:
Belarusian State University of Informatics and Radioelectronics, 6, P. Brovka street, Minsk 220013, Belarus
Venue:
Discrete Optimization
Year:
2009

Citing 3
Cited 0

Preemptive scheduling of equal length jobs on two machines to minimize mean flow time

Operations Research
Minimizing mean flow time with release time constraint

Theoretical Computer Science
The complexity of mean flow time scheduling problems with release times

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem of scheduling n jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective is to find a schedule minimizing total completion time. We suggest an O(n^3) algorithm to solve this problem.