Minimizing total tardiness for scheduling identical parallel machines with family setups.
Jeffrey E. SchallerPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- identical parallel machines
- minimizing total tardiness
- scheduling problem
- fixed number
- processing times
- release dates
- single server
- parallel machines
- competitive ratio
- strongly np hard
- flowshop
- special case
- single machine
- tabu search
- setup times
- sequence dependent setup times
- finite number
- single machine scheduling problem