Dynamic resource allocation heuristics that manage tradeoff between makespan and robustness.
Ashish M. MehtaJay SmithHoward Jay SiegelAnthony A. MaciejewskiArun JayaseelanBin YePublished in: J. Supercomput. (2007)
Keyphrases
- dynamic resource allocation
- resource allocation
- scheduling problem
- search algorithm
- allocation policies
- heuristic search
- np hard
- greedy heuristics
- processing times
- lot streaming
- effectively manage
- computational efficiency
- computational complexity
- flowshop scheduling problems
- high robustness
- scheduling jobs
- optimal solution
- trade off