Login / Signup
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval.
Imed Kacem
Published in:
CTW (2010)
Keyphrases
</>
polynomial time approximation
makespan minimization
np hard
approximation algorithms
error bounds
single machine
identical machines
job processing times
special case
bin packing
lower bound
linear programming
worst case
mathematical model
release dates