Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates.
Boris DetienneEric PinsonDavid RivreauPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- earliness tardiness
- single machine
- release dates
- scheduling problem
- single machine scheduling problem
- minimize total
- processing times
- maximum lateness
- total weighted tardiness
- sequence dependent setup times
- parallel machines
- scheduling jobs
- dynamic programming
- lagrangian relaxation
- precedence constraints
- branch and bound algorithm
- tabu search
- response time
- optimal solution