Algorithms minimizing mean flow time: Schedule-length properties
From MaRDI portal
Publication:1219159
DOI10.1007/BF00263740zbMath0309.68039OpenAlexW2027372432MaRDI QIDQ1219159
Ravi Sethi, Edward G. jun. Coffman
Publication date: 1976
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00263740
Related Items (11)
Makespan minimization subject to flowtime optimality on identical parallel machines ⋮ Comparing the minimum completion times of two longest-first scheduling-heuristics ⋮ Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ An algorithm for flow time minimization and its asymptotic makespan properties ⋮ Scheduling with bully selfish jobs ⋮ Minimizing makespan subject to minimum flowtime on two identical parallel machines ⋮ Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture ⋮ Minimizing makespan subject to minimum total flow-time on identical parallel machines ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
This page was built for publication: Algorithms minimizing mean flow time: Schedule-length properties
