Scheduling a single machine with job family setup times to minimize total tardiness.
Khaled S. AbdallahJaejin JangPublished in: ICE/ITMC (2017)
Keyphrases
- branch and bound
- minimize total
- single machine
- setup times
- processing times
- release dates
- scheduling problem
- single machine scheduling problem
- scheduling jobs
- weighted tardiness
- sequence dependent setup times
- identical machines
- flowshop
- identical parallel machines
- total weighted tardiness
- completion times
- special case
- strongly np hard
- dynamic programming
- precedence constraints
- np hard
- parallel machines
- tabu search
- job shop