Algorithms for solving minimax scheduling problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 1985661 (Why is no real title available?)
- Job Shop Scheduling by Simulated Annealing
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Synthesizing structures of real-time computer systems using genetic algorithms
Cited in
(17)- Synthesizing optimization algorithms for scheduling partially ordered set of problems
- Some algorithms of solving minimax multiprocessor scheduling problem
- Sequential and parallel computations in the general scheduling problem
- A makespan minimization problem for versatile developers in the game industry
- Aggregation in the task of composition of the optimal schedule for multiprocessor automated control systems
- On the optimality of exact and approximation algorithms for scheduling problems
- scientific article; zbMATH DE number 3958724 (Why is no real title available?)
- The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets
- scientific article; zbMATH DE number 3970495 (Why is no real title available?)
- Job control in heterogeneous computing systems
- scientific article; zbMATH DE number 56358 (Why is no real title available?)
- Design of computational processes in hierarchic systems
- scientific article; zbMATH DE number 3906215 (Why is no real title available?)
- Nonpreemptive scheduling of arbitrary machines
- An optimal schedule for printing and binding†
- scientific article; zbMATH DE number 220149 (Why is no real title available?)
- scientific article; zbMATH DE number 3991267 (Why is no real title available?)
This page was built for publication: Algorithms for solving minimax scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734231)