Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
From MaRDI portal
Publication:3202129
DOI10.1287/opre.38.3.487zbMath0715.90064MaRDI QIDQ3202129
Joseph Y.-T. Leung, Lee A. Herrbach
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.3.487
release times; mean flow time; equal-length jobs; identical, parallel machines; nonpreemptive and preemptive scheduling
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Preemptive scheduling of two uniform parallel machines to minimize total tardiness, Preemptive scheduling of equal-length jobs in polynomial time, The complexity of mean flow time scheduling problems with release times, Preemptive scheduling to minimize mean weighted flow time, Minimizing mean flow time with release time constraint, Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines, Normal-form preemption sequences for an open problem in scheduling theory, Preemptive scheduling on identical parallel machines subject to deadlines., Ideal schedules in parallel machine settings, Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
