Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times.

Imed Kacem Hans Kellerer

Published in: Discret. Appl. Math. (2014)

Keyphrases

approximation algorithms
release times
single machine
scheduling problem
np hard
release dates
processing times
single machine scheduling problem
maximum lateness

special case
scheduling jobs
precedence constraints
deteriorating jobs
learning effect
number of late jobs
worst case
sequence dependent setup times
setup times

production scheduling
dynamic programming
approximation ratio
competitive ratio
job shop
flowshop
identical machines
parallel machines

completion times
lower bound
optimal solution
job shop scheduling problem
computational complexity
polynomial time approximation
linear programming
combinatorial auctions