A dominance relation enhanced branch-and-bound task allocation

Journal of Systems and Software

Volumn 58, Issue 2, 2001, Pages 125-134

  Ma, Yung Cheng ^a   Chung, Chung Ping ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Branch and bound algorithm; Dominance relation; Task allocation

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; HEURISTIC METHODS; OPTIMIZATION; STATE SPACE METHODS;

TASK ALLOCATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0035451709     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(01)00033-4     Document Type: Article

References (17)

1. An efficient algorithm for a task allocation problem
2. On the assignment problem of arbitrary process systems to heterogeneous distributed systems
3. An optimal instruction scheduler for superscalar processor
4. A formal basis for the heuristic determination of minimum cost paths
5. Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
6. Allocating task interaction graphs to processors in heterogeneous networks
7. Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems
8. Optimal task assignment in homogeneous networks
9. Heuristic algorithms for task assignment in distributed systems
10. Optimal scheduling of cooperative tasks in a distributed system using an enumerative method
11. A task allocation model for distributed computing systems
12. A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion
13. Efficient computation of optimal assignment for distributed tasks
14. Multiprocessor scheduling with the aid of network flow algorithms
15. Algorithms for reliability-oriented module allocation in distributed computing systems
16. Fast allocation of processes in distributed and parallel systems