MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server.
Mi-Yi KimYoung Hoon LeePublished in: Comput. Oper. Res. (2012)
Keyphrases
- parallel machines
- scheduling problem
- single server
- hybrid algorithm
- tabu search
- setup times
- retrial queue
- total tardiness
- flowshop
- unrelated parallel machines
- sequence dependent setup times
- precedence constraints
- single machine
- release dates
- parallel computing
- feasible solution
- particle swarm optimization
- genetic algorithm
- np hard
- ant colony optimization
- special case
- identical parallel machines
- shared memory
- probabilistic model
- differential evolution
- simulated annealing
- queue length
- processing times
- particle swarm optimization pso
- state dependent
- branch and bound algorithm
- lower bound