Tight bounds for the identical parallel machine scheduling problem.
Mohamed HaouariAnis GharbiMahdi JemmaliPublished in: Int. Trans. Oper. Res. (2006)
Keyphrases
- tight bounds
- parallel machine scheduling problem
- scheduling problem
- upper bound
- release dates
- total weighted tardiness
- parallel machines
- sequence dependent setup times
- single machine
- maximum lateness
- lower bound
- processing times
- job shop scheduling problem
- flowshop
- setup times
- tabu search
- np hard
- precedence constraints
- evolutionary algorithm