Ph.D. Thesis:
Ph.D. Thesis:
"Algorithms with
performance guarantees for scheduling problems" (1981)
by Sergey Sevastianov
Supervisor: Dr. Nikolay Glebov
The defense was held at Council К 002.23.01 at the Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences; head of the Council - Prof. A.A.Borovkov.
Official opponents: Prof. Dr. Vl.D. Mazurov and Dr. A.A. Yevdokimov.
Leading Organization: Department of Computational Mathematics and Cybernetics of the Moscow State University (the chair of S.V. Yablonski, corresponding member of RAS)
Brief Annotation:
The Thesis consists of an Introduction and three chapters. In Chapters 2 and 3, efficient algorithms with performance guarantees for scheduling problems with independent operations and consecutive operations of each job are constructed. The algorithms are based on efficient algorithms for a Compact Vector Summation problem (CVS) investigated in Chapter 1.
For more details, click here.
