A New O(n log n) Scheduling Heuristic for Parallel Decomposition of Sparce Matrices.
Ricardo TelicheveskyPrathima AgrawalJohn A. TrotterPublished in: ICCD (1991)
Keyphrases
- parallel machines
- list scheduling
- iterative repair
- identical machines
- scheduling problem
- depth first search
- multiprocessor systems
- unrelated parallel machines
- decomposition methods
- scheduling algorithm
- scheduling jobs
- tabu search
- batch processing machines
- processing times
- scheduling policies
- dynamic programming
- distributed memory
- rolling horizon
- critical path
- parallel processors
- optimal solution
- parallel processing
- lower bound
- flexible manufacturing systems
- computer architecture
- job shop scheduling problem
- pairwise comparison
- parallel implementation
- solution quality
- single machine
- resource allocation
- simulated annealing