Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times.
M. T. Yazdani SabouniFariborz JolaiS. Afshin MansouriPublished in: J. Intell. Manuf. (2010)
Keyphrases
- setup times
- identical parallel machines
- single machine
- processing times
- scheduling problem
- release dates
- strongly np hard
- sequence dependent setup times
- flowshop
- single machine scheduling problem
- precedence constraints
- tabu search
- np hard
- resource consumption
- completion times
- dynamic programming
- search algorithm
- parallel machines