1 . Jansen K., Porkolab L. Improved approximation
schemes for scheduling unrelated parallel machines //
Proceedings of the thirty-first annual ACV symposium
on theory of computing. Atlanta, Georgia, United States,
May 01-04 1999. Р. 408-417.
2 . Serna M., Xhafa F. Approximating scheduling
unrelated parallel machines in parallel // Computational
Optimization and Applications. 2002. V. 21. P. 325-338.
3 . Lenstra J.K., Shmoys D.B., Tardos E. Approximation
algorithms for scheduling unrelated parallel machines
// Mathematical Programming. 1990. V. 46.
P. 259-271.
4 . Samadzadeh F.A., Hedrick G.E. Near-optimal
multiprocessor scheduling // Proceedings of the 1992
ACV annual conference on communications. Kansas
City, Missouri, United States, March 03-05 1992.
Р. 477-484.
5 . Samadzadeh F.A., Hedrick G.E. A heuristic multiprocessor
scheduling algorithm for creating near-optimal
schedules using task system graphs // Proceedings of the
1992 ACV/SIGAPP symposium on applied computing:
technological challenges of the 1990?s. Kansas City, Missouri,
United States, March 1992. P. 711-718.
6 . Sinnen O., Kozlov A.V., Shahul A.Z.S. Optimal
scheduling of task graphs on parallel systems // 25th
LASTED International Multi-Conference Parallel and
Distributed Computing and Networks. 2007.
7 . Корбут А.А., Финкельштейн Ю.Ю. Дискрет-
ное программирование. М.: Наука, 1969. 368 с.
|
