Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.
Danyu BaiLixin TangPublished in: COCOA (2007)
Keyphrases
- flowshop
- worst case analysis
- lower bound
- scheduling problem
- worst case
- np hard
- linear programming relaxation
- upper bound
- np hardness
- greedy heuristic
- average case
- processing times
- setup times
- special case
- flowshop scheduling
- branch and bound
- sequence dependent setup times
- branch and bound algorithm
- maximum lateness
- objective function
- optimal solution
- tabu search
- single machine
- lower and upper bounds
- approximation algorithms
- knapsack problem
- strongly np hard
- precedence constraints
- flowshop scheduling problems
- completion times
- minimum cost
- greedy algorithm
- np complete
- lagrangian relaxation
- parallel machines
- integer programming
- uniform distribution
- ant colony optimization
- random variables