Lower bounds for minimizing total completion time in a two-machine flow shop.
Han HoogeveenLinda van NordenSteef L. van de VeldePublished in: J. Sched. (2006)
Keyphrases
- lower bound
- processing times
- scheduling problem
- single machine
- upper bound
- np hard
- branch and bound algorithm
- branch and bound
- objective function
- optimal solution
- upper and lower bounds
- lower and upper bounds
- vc dimension
- flowshop
- worst case
- lower bounding
- optimal cost
- tabu search
- lagrangian relaxation
- concept class
- quadratic assignment problem
- set of randomly generated instances