Algorithms for solving minimax scheduling problem
From MaRDI portal
Publication:734231
DOI10.1134/S1064230708050067zbMATH Open1173.93389MaRDI QIDQ734231FDOQ734231
Authors: D. V. Krasovskii, M. G. Furugyan
Publication date: 20 October 2009
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Recommendations
Optimal stochastic control (93E20) Stochastic scheduling theory in operations research (90B36) Control/observation systems involving computers (process control, etc.) (93C83)
Cites Work
Cited In (15)
- Title not available (Why is that?)
- Synthesizing optimization algorithms for scheduling partially ordered set of problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonpreemptive scheduling of arbitrary machines
- Design of computational processes in hierarchic systems
- An optimal schedule for printing and binding†
- The construction of ε-approximate algorithms for the optimization of functions in successively constructed sets
- Aggregation in the task of composition of the optimal schedule for multiprocessor automated control systems
- Title not available (Why is that?)
- Sequential and parallel computations in the general scheduling problem
- Job control in heterogeneous computing systems
- Title not available (Why is that?)
- Some algorithms of solving minimax multiprocessor scheduling problem
Uses Software
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)