Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm.
Laleh GhalamiDaniel GrosuPublished in: J. Parallel Distributed Comput. (2019)
Keyphrases
- identical machines
- polynomial time approximation
- parallel implementation
- multiprocessor systems
- job scheduling
- np hard
- dynamic programming
- parallel machines
- processing times
- hybrid algorithm
- error bounds
- worst case
- scheduling problem
- shared memory
- evolutionary algorithm
- optimal solution
- objective function
- theoretical analysis
- particle swarm optimization
- precedence constraints
- single machine scheduling problem
- search space