Dedicated scheduling of tasks to minimize mean flow time - Publication - MOST Wiedzy

Search

Dedicated scheduling of tasks to minimize mean flow time

Abstract

This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.

Cite as

Full text

full text is not available in portal

Keywords

Details

Category:
Articles
Type:
artykuł w czasopiśmie z listy filadelfijskiej
Published in:
LECTURE NOTES IN COMPUTER SCIENCE no. 2328, pages 87 - 96,
ISSN: 0302-9743
Language:
English
Publication year:
2002
Bibliographic description:
Giaro K., Kubale M., Małafiejski M., Piwakowski K.: Dedicated scheduling of tasks to minimize mean flow time// LECTURE NOTES IN COMPUTER SCIENCE. -Vol. 2328., (2002), s.87-96
Verified by:
Gdańsk University of Technology

seen 16 times

Recommended for you

Meta Tags