A Lower Bound for the Job Insertion Problem.
Tamás KisAlain HertzPublished in: Discret. Appl. Math. (2003)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- single machine scheduling problem
- processing times
- np hard
- lower and upper bounds
- objective function
- worst case
- optimal solution
- competitive ratio
- job scheduling
- linear programming relaxation
- lower bounding
- integer programming
- search algorithm
- upper and lower bounds
- data sets
- randomized algorithm
- identical machines
- job search
- sufficiently accurate