Some algorithms of solving minimax multiprocessor scheduling problem

DOI10.1134/S1064230714020087zbMath1317.90119MaRDI QIDQ2263888

M. G. Furugyan

Publication date: 19 March 2015

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

zbMATH Keywords

branch and bound methodparallelizing of the algorithmschedules of minimal length

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Mathematical problems of computer architecture (68M07)

Related Items (1)

Algorithm for resource allocation in data centers with independent schedulers for different types of resources

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for solving minimax scheduling problem
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Transport-type problems with a minimax criterion
• Transportation problems with a minimax criterion
• Synthesizing structures of real-time computer systems using genetic algorithms
• Ant algorithms: theory and applications
• Hereditarily minimax matrices in models of transportation type

This page was built for publication: Some algorithms of solving minimax multiprocessor scheduling problem