The Complexity of Optimal Job Co-Scheduling on Chip Multiprocessors and Heuristics-Based Solutions.
Yunlian JiangKai TianXipeng ShenJinghe ZhangJie ChenRahul TripathiPublished in: IEEE Trans. Parallel Distributed Syst. (2011)
Keyphrases
- optimal solution
- worst case
- shortest processing time
- scheduling problem
- job scheduling
- job shop
- scheduling algorithm
- space complexity
- heuristic methods
- optimal scheduling
- tabu search algorithm
- hyper heuristics
- processing times
- suboptimal solutions
- high speed
- resource allocation
- batch processing
- greedy heuristic
- heuristic search
- high density
- round robin
- search methods
- release dates
- multiple objectives
- simulated annealing
- identical machines
- identical parallel machines
- asymptotic optimality
- scheduling decisions
- benchmark problems
- flowshop
- dynamic programming
- deteriorating jobs
- simulated annealing and tabu search
- search algorithm