Publication:4228496
From MaRDI portal
zbMath0915.90151MaRDI QIDQ4228496
Gerhard J. Woeginger, Hans Kellerer, Thomas Tautenhahn
Publication date: 5 July 1999
single machine; worst-case performance; NP-complete; total flow time; polynomial time approximations
68Q25: Analysis of algorithms and problem complexity
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
On-line scheduling to minimize Max flow time: an optimal preemptive algorithm, Minimizing average completion time in the presence of release dates, Minimizing flow time on a constant number of machines with preemption, Polynomial time approximation algorithms for machine scheduling: Ten open problems, Lower bounds for on-line single-machine scheduling., Average stretch without migration, Approximation algorithms for scheduling problems with a modified total weighted tardiness objective, Optimal on-line flow time with resource augmentation, Designing PTASs for MIN-SUM scheduling problems, Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models, Approximating total flow time on parallel machines