On the Complexity of Mean Flow Time Scheduling

DOI10.1287/moor.2.4.320zbMath0402.90046OpenAlexW2136156086MaRDI QIDQ4187560

Ravi Sethi

Publication date: 1977

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2.4.320

zbMATH Keywords

Computational ComplexityNp-CompleteIdentical Parallel MachinesMean Flow Time SchedulingSeries-Parallel Precedence ConstraintsTree- Like Precedence Constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items

Task scheduling with precedence constraints to minimize the total completion time, A state-of-the-art review of parallel-machine scheduling research, Minimizing the makespan on two identical parallel machines with mold constraints, NP-Complete operations research problems and approximation algorithms, Scheduling chain-structured tasks to minimize makespan and mean flow time