Sequential and parallel computations in the general scheduling problem
From MaRDI portal
Recommendations
Cited in
(19)- The general problem solving algorithm and its implementation
- Parallel algorithms for solution of problems in scheduling theory
- Design of computational processes in hierarchic systems
- Provable algorithms for parallel generalized sweep scheduling
- scientific article; zbMATH DE number 4172355 (Why is no real title available?)
- scientific article; zbMATH DE number 3850807 (Why is no real title available?)
- Parallelizing of algorithms on the basis of splitting of macro-operations
- Construction of generalized parallelizing functions
- scientific article; zbMATH DE number 3958723 (Why is no real title available?)
- scientific article; zbMATH DE number 3991269 (Why is no real title available?)
- scientific article; zbMATH DE number 67289 (Why is no real title available?)
- scientific article; zbMATH DE number 2000819 (Why is no real title available?)
- scientific article; zbMATH DE number 1760037 (Why is no real title available?)
- scientific article; zbMATH DE number 220149 (Why is no real title available?)
- scientific article; zbMATH DE number 2087847 (Why is no real title available?)
- scientific article; zbMATH DE number 1884457 (Why is no real title available?)
- The schedule-sequencing problem
- Scheduling and stability aspects of a general class of parallel processing systems
- A parallel ``Go with the winners algorithm for some scheduling problems
This page was built for publication: Sequential and parallel computations in the general scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q917432)