Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithms for solving minimax scheduling problem

From MaRDI portal
Publication:734231
Jump to:navigation, search

DOI10.1134/S1064230708050067zbMath1173.93389MaRDI QIDQ734231

M. G. Furugyan, D. V. Krasovskii

Publication date: 20 October 2009

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)


zbMATH Keywords

multiprocessor systemexact and approximate algorithmstime-optimal scheduling


Mathematics Subject Classification ID

Control/observation systems involving computers (process control, etc.) (93C83) Stochastic scheduling theory in operations research (90B36) Optimal stochastic control (93E20)


Related Items (2)

Job control in heterogeneous computing systems ⋮ Some algorithms of solving minimax multiprocessor scheduling problem


Uses Software

  • Tabu search



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Probabilistic construction of deterministic algorithms: approximating packing integer programs
  • Synthesizing structures of real-time computer systems using genetic algorithms
  • Job Shop Scheduling by Simulated Annealing




This page was built for publication: Algorithms for solving minimax scheduling problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:734231&oldid=12648821"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki