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

DOI10.1287/OPRE.38.3.487MaRDI QIDQ3202129zbMATH OpenOpenAlexFDO

Authors Lee A. Herrbach, Joseph Y.-T. Leung

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

zbMATH Keywords

mean flow timerelease timesequal-length jobsidentical, parallel machinesnonpreemptive and preemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Preemptive scheduling on uniform machines to minimize mean flow time
• Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• The complexity of mean flow time scheduling problems with release times
• Minimizing Schedule Length Subject to Minimum Flow Time
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

Cited in

(15)

• Minimizing Schedule Length Subject to Minimum Flow Time
• Preemptive scheduling of equal-length jobs in polynomial time
• Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
• 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 to minimize mean weighted flow time
• Ideal schedules in parallel machine settings
• Preemptive scheduling of equal-length jobs to maximize weighted throughput.
• Preemptive scheduling on identical parallel machines subject to deadlines.
• Minimizing mean flow time with release time constraint
• Ideal preemptive schedules on two processors
• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• The complexity of mean flow time scheduling problems with release times
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness
• Preemptive scheduling on uniform machines to minimize mean flow time

This page was built for publication: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202129)