Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines.
Johnny C. HoFrancisco J. LópezAlex J. Ruiz-TorresTzu-Liang (Bill) TsengPublished in: J. Intell. Manuf. (2011)
Keyphrases
- completion times
- scheduling problem
- identical parallel machines
- flowshop
- processing times
- single machine
- scheduling jobs
- strongly np hard
- flowshop scheduling
- competitive ratio
- np hard
- setup times
- special case
- permutation flowshop
- sequence dependent setup times
- tabu search
- release dates
- single machine scheduling problem
- precedence constraints
- parallel machines
- evolutionary algorithm