Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

1 June 1990

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 38 (3) , 487-494
https://doi.org/10.1287/opre.38.3.487

Abstract

We give an O(n log n) time algorithm to preemptively schedule n equal-length jobs with release times on two identical, parallel machines so as to minimize the mean flow time. The complexity of the general problem of minimizing the mean weighted flow time is also reviewed, both for nonpreemptive and preemptive scheduling.

Keywords

SCHEDULE
EQUAL LENGTH
LENGTH JOBS
MACHINES
MINIMIZE THE MEAN
FLOW TIME
PREEMPTIVE

This publication has 0 references indexed in Scilit: