A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times.
Jean-Paul ArnaoutGhaith RabadiRami MusaPublished in: J. Intell. Manuf. (2010)
Keyphrases
- ant colony optimization algorithm
- sequence dependent setup times
- parallel machines
- setup times
- scheduling problem
- ant colony optimization
- flowshop
- traveling salesman problem
- precedence constraints
- ant colony algorithm
- single machine
- lot sizing
- release dates
- processing times
- single machine scheduling problem
- multi item
- parallel computing
- single server
- hybrid algorithm
- shared memory
- lagrangian relaxation
- special case
- supply chain
- np hard