Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times.
Vahid KayvanfarG. M. KomakiAmin AalaeiMostafa ZandiehPublished in: Comput. Oper. Res. (2014)
Keyphrases
- unrelated parallel machines
- single machine
- scheduling problem
- sequence dependent setup times
- setup times
- flowshop
- parallel machines
- processing times
- release dates
- single machine scheduling problem
- precedence constraints
- np hard
- identical parallel machines
- completion times
- tabu search
- competitive ratio
- integer programming
- special case
- upper bound