A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors.
Giuseppe PalettaPaolamaria PietramalaPublished in: SIAM J. Discret. Math. (2007)
Keyphrases
- parallel processors
- scheduling problem
- precedence constraints
- parallel machines
- computational complexity
- dynamic programming
- learning algorithm
- optimal scheduling
- scheduling strategy
- parallel version
- np hard
- objective function
- heuristic search
- space complexity
- simulated annealing
- worst case
- search space
- information retrieval