Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
Lee A. Herrbach, Joseph Y.-T. Leung
Operations Research · 1990 · Volume 38 · Issue 3
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
production/scheduling: deterministic job shop scheduling, production/scheduling line balancing: mean weighted flow time
Enable JavaScript for citation tools and additional paper interactions.