Search techniques for a nonlinear multiprocessor scheduling problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3991267
- Multiprocessor scheduling by generalized extremal optimization
- A nonidentical parallel processor scheduling problem
- Multi-processor search and scheduling problems with setup cost
- Efficiency of the methods of scheduling complex sets of tasks in nonuniform multiprocessor computer systems
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Publication:3211131
- scientific article; zbMATH DE number 67289
- A parallel approximation scheme for the multiprocessor scheduling problem
Cites work
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- The art and theory of dynamic programming
Cited in
(6)- An algorithm for the multiprocessor assignment problem
- An LC branch-and-bound algorithm for the module assignment problem
- Allocating programs containing branches and loops within a multiple processor system
- Task allocation model for distributed systems
- scientific article; zbMATH DE number 1203408 (Why is no real title available?)
- scientific article; zbMATH DE number 553908 (Why is no real title available?)
This page was built for publication: Search techniques for a nonlinear multiprocessor scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3319771)