Job distribution algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3140514 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 193197 (Why is no real title available?)
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Bounds for Certain Multiprocessing Anomalies
- Dynamic programming in the problem of decomposition optimization
- Dynamic programming in the problem of optimization of a covering
- Matroids and the greedy algorithm
- Partitioning a finite set by a dynamic programming method
Cited in
(6)- Task allocation in distributed processing systems
- Distribution of computer jobs in automatic control systems on the basis of infinite-valued logic
- scientific article; zbMATH DE number 3854767 (Why is no real title available?)
- Job assignment in a two-level active system of a team of programmers
- An approach to solution of the movements routing problem with several participants
- Distribution of assignments among participants under conditions of constraints
This page was built for publication: Job distribution algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q885731)