Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics.
Andrew BilykLars MönchChristian AlmederPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- precedence constraints
- scheduling jobs
- parallel machines
- identical machines
- scheduling problem
- release dates
- shared memory
- processing times
- branch and bound algorithm
- tabu search
- parallel processors
- single machine
- single machine scheduling problem
- parallel computing
- sequence dependent setup times
- setup times
- flowshop
- partial order
- optimal solution
- single server
- simulated annealing
- branch and bound
- combinatorial optimization
- metaheuristic
- approximation algorithms
- particle swarm optimization
- special case
- identical parallel machines
- np hard
- optimization problems
- ant colony optimization
- parallel algorithm
- partially ordered
- lot sizing