DocumentCode :
2634361
Title :
Bicriterion scheduling of identical processing time jobs by uniform processors
Author :
Tuzikov, A. ; Makhaniok, M. ; Männer, R.
Author_Institution :
Inst. of Eng. Cybern., Acad. of Sci., Minsk, Byelorussia
fYear :
1995
fDate :
25-28 Apr 1995
Firstpage :
276
Lastpage :
279
Abstract :
The problem of bicriterion scheduling of jobs with identical processing times by uniform processors is considered. The first criterion is the minimization of either total or maximum costs, the second one is the minimization of maximum cost with different cost functions. Polynomial time algorithms are presented to determine all efficient solutions and the optimal solution for a given global criterion
Keywords :
computational complexity; operations research; parallel algorithms; processor scheduling; bicriterion scheduling; identical processing time jobs; multicriterion job scheduling; polynomial time algorithms; uniform processors; Cities and towns; Cost function; Polynomials; Processor scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7074-6
Type :
conf
DOI :
10.1109/IPPS.1995.395945
Filename :
395945
Link To Document :
بازگشت