An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines.
Manzhan GuJinwei GuXiwen LuPublished in: J. Sched. (2018)
Keyphrases
- parallel machines
- multi agent
- computational complexity
- scheduling problem
- np hard
- cost function
- dynamic programming
- worst case
- matching algorithm
- distributed systems
- probabilistic model
- scheduling jobs
- total tardiness
- minimize total
- release dates
- precedence constraints
- simulated annealing
- genetic algorithm
- search space
- pairwise
- optimal solution
- similarity measure
- image segmentation