On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems.

R. N. Uma Joel Wein

Published in: IPCO (1998)

Keyphrases

scheduling problem
np hard
linear programming
optimal solution
special case
linear program
single machine
np hardness
computational complexity
flowshop
information retrieval
decision problems
branch and bound algorithm
integer programming
strengths and weaknesses
processing times