Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems.
J. A. HoogeveenSteef L. van de VeldePublished in: Math. Program. (1995)
Keyphrases
- scheduling problem
- flowshop
- minimizing makespan
- parallel machines
- upper bound
- sequence dependent setup times
- strongly np hard
- single machine
- processing times
- parallel machine scheduling problem
- setup times
- lower bound
- preventive maintenance
- loss function
- np hard
- job shop scheduling
- random variables
- greedy heuristics
- job shop scheduling problem
- precedence constraints
- learning machines
- linear functions
- job shop
- upper and lower bounds
- optimal solution
- lower and upper bounds
- maximum lateness
- duality gap
- tabu search
- causal relationships
- identical machines
- variable selection
- dual variables
- error bounds
- sequencing problems