Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times.
Alper HamzadayiGokalp YildizPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- scheduling problem
- sequence dependent setup times
- identical parallel machines
- strongly np hard
- minimizing total tardiness
- single machine
- flowshop
- parallel machines
- setup times
- release dates
- single server
- precedence constraints
- processing times
- single machine scheduling problem
- np hard
- tabu search
- lot sizing
- competitive ratio
- fixed number
- lower bound
- approximation algorithms