Improving the solution complexity of the scheduling problem with deadlines: A general technique.

Amir Elalouf Eugene Levner

Published in: RAIRO Oper. Res. (2016)

Keyphrases

scheduling problem
single machine
special case
computational complexity
worst case
np hard
minimizing makespan
greedy algorithm
earliness tardiness
optimal solution
greedy heuristics
pspace complete
linear equations
flowshop
tabu search
linear programming
response time
computational cost