The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard.
T. C. Edwin ChengC. T. NgJinjiang YuanPublished in: J. Sched. (2003)
Keyphrases
- setup times
- single machine
- maximum lateness
- strongly np hard
- scheduling problem
- completion times
- processing times
- sequence dependent setup times
- release dates
- flowshop
- scheduling jobs
- single machine scheduling problem
- precedence constraints
- identical parallel machines
- special case
- dynamic programming
- np hard
- parallel machines
- tabu search
- response time
- search algorithm