Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates.
Safia Kedad-SidhoumYasmín Á. Ríos-SolísFrancis SourdPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- earliness tardiness
- parallel machines
- scheduling problem
- lower bound
- processing times
- np hard
- single machine
- flowshop
- upper bound
- unrelated parallel machines
- precedence constraints
- sequence dependent setup times
- total tardiness
- setup times
- release dates
- branch and bound algorithm
- branch and bound
- strongly np hard
- tabu search
- objective function
- optimal solution
- single server
- parallel computing
- worst case
- lower and upper bounds
- single machine scheduling problem
- integer programming
- maximum lateness
- lagrangian relaxation
- linear programming
- image segmentation
- resource consumption
- lot sizing