Dedicated scheduling of Biprocessor tasks to minimize mean flow time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2328, Issue , 2002, Pages 87-96

  Giaro, Krzysztof ^a   Kubale, Marek ^a   Małafiejski, Michał ^a   Piwakowski, Konrad ^a  

^a GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACYCLIC GRAPHS; DEDICATED PROCESSORS; MEAN FLOW TIME; NP-HARD; POLYNOMIALLY SOLVABLE SPECIAL CASE; STRONGLY NP-HARD;

SCHEDULING;

EID: 84947597939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_10     Document Type: Conference Paper

References (16)

1. Coffman, Jr., E.G., Garey, M.R., Johnson, D.S., LaPaugh, A.S.: Scheduling file transfers. SIAM J. Comput. 14 (1985) 744-780
2. Cole, R., Ost, K., Schirra, S., Edge-coloring bipartite graphs in O (E logD) time. Combinatorica 21 (2001) 5-12
3. Dobson, G., Karmarkar, U.S.: Simultaneous resourse scheduling to minimize weighted flow times. Oper. Res. 37 (1989) 592-600
4. Drozdowski, M.: Scheduling multiprocessor tasks - An overview. Euro. J. Oper. Res. 94 (1996) 215-230
5. Drozdowski, M., Dell’Olmo, P.: Scheduling multiprocessor tasks for mean flow time criterion. Comp. Oper. Res. 27 (2000) 571-585
6. Gehringer, E.F., Siewiorek, D.P., Segall, Z.: Parallel Processing: The Cm* Experience. Digital Press, Bedford (1987)
7. Giaro, K., Kubale, M., MaFlafiejski, M., Piwakowski, K.: Chromatic scheduling of dedicated 2-processor UET tasks to minimize mean flow time. Proc. ETFA’99, Barcelona (1999) 343-347
8. Giaro, K., Kubale, M.: Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75 (2000) 65-69
9. Giaro, K., Kubale, M., Piwakowski, K.: Complexity results on open shop scheduling to minimize weighted mean flow time of operations. (in preparation)
10. Halldórsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A., Multicoloring trees. Computing and Combinatorics Conference, Tokyo (1999), Lecture Notes in Computer Science 1627 (1999) 271-280
11. Hoogeveen, J.A., van de Velde, S.L., Veltman, B.: Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Disc. Appl. Math. 55 (1994) 259-272
12. Krawczyk, H., Kubale, M.: An approximation algorithm for diagnostic test scheduling in multicomputer systems. IEEE Trans. Comput. 34 (1985) 869-872
13. Kubale, M.: The complexity of scheduling independent two-processor tasks on dedicated processors. Inf. Process. Lett. 24 (1987) 141-147
14. Kubale, M.: Preemptive versus nonpreemptive scheduling of biprocessor tasks on dedicated processors. Euro. J. Oper. Res. 94 (1996) 242-251
15. Kubale, M., Piwakowski, K.: A linear algorithm for edge coloring of binomial trees. Disc. Math. 150 (1996) 247-256
16. Zhou, X., Nishizeki, T.: Algorithms for the cost edge-coloring of tress. Lecture Notes in Computer Science 2108 (2001) 288-297