On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can an Optimal Solution be Nonoptimal?
Nadimpalli V. R. MahadevAleksandar PekecFred S. RobertsPublished in: Oper. Res. (1998)
Keyphrases
- optimal solution
- scheduling problem
- np hard
- single machine
- flowshop
- linear programming
- lower bound
- knapsack problem
- job shop scheduling
- setup times
- branch and bound
- objective function
- metaheuristic
- tabu search
- solution quality
- feasible solution
- parallel machines
- job shop scheduling problem
- precedence constraints
- branch and bound algorithm
- np complete
- search space
- processing times
- job shop
- linear program
- total cost
- heuristic methods
- approximate solutions
- approximation algorithms
- limited capacity
- global optimum
- greedy heuristics
- mixed integer
- constraint satisfaction problems
- obtain the optimal solution
- special case
- list scheduling
- sequence dependent setup times
- solution space
- initial solution
- lp relaxation
- integer programming
- column generation