首页 | 本学科首页   官方微博 | 高级检索  
     


Scheduling groups of tasks with precedence constraints on three dedicated processors
Affiliation:1. Dipartimento di Elettronica per l''Automazione, Università di Brescia, via Branze 38, I-25123 Brescia, Italy;2. Dipartimento Metodi Quantitativi, Università di Brescia, Contrada S. Chiara 48/b, I-25122 Brescia, Italy;3. Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111 Budapest, Hungary
Abstract:We study the problem of scheduling groups of tasks with precedence constraints on three dedicated processors. Each task requires a specified set of processors. Up to three precedence constraints are considered among groups of tasks requiring the same set of processors. The objective of the problem is to find a nonpreemptive schedule which minimizes the maximum completion time (makespan). This scheduling problem is equivalent to the problem of finding an extension of the constraint graph (i.e. the graph which represents the conflicts between tasks and the precedence constraints) to a comparability graph with minimum (over all the extensions) maximum clique weight. The problem is NP-hard in the strong sense. A normal schedule is such that all the tasks requiring the same set of processors are scheduled consecutively. With a normal schedule the problem reduces to the quotient graph of the constraint graph. In this paper we obtain tight approximation results for the minimum makespan of a normal schedule through tight results on the minimum increase of the maximum clique weight when the (partially oriented) quotient graph is extended to a comparability graph.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号