Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems.
J. A. HoogeveenSteef L. van de VeldePublished in: IPCO (1993)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- parallel machine scheduling problem
- single machine
- np hard
- minimizing makespan
- processing times
- sequence dependent setup times
- upper bound
- strongly np hard
- lower bound
- setup times
- preventive maintenance
- job shop scheduling problem
- special case
- variable selection
- random variables
- tabu search
- upper and lower bounds
- release dates
- dual variables
- maximum lateness
- sequencing problems
- optimal solution
- job shop scheduling
- precedence constraints
- independent variables
- error bounds
- worst case
- production scheduling
- job shop
- lagrangian relaxation
- lower and upper bounds
- causal relationships
- scheduling decisions
- duality gap
- genetic algorithm
- worst case bounds
- quay crane