Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays.
Mohamed Amine MkademAziz MoukrimMehdi SerairiPublished in: OR (2016)
Keyphrases
- lower bound
- upper bound
- scheduling problem
- processing times
- np hard
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- worst case
- running times
- lagrangian relaxation
- optimal solution
- vc dimension
- single machine
- lower bounding
- optimal cost
- upper and lower bounds
- max sat
- linear programming relaxation
- quadratic assignment problem