Scheduling multiprocessor tasks to minimise the makespan on two dedicated processors

In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have to be scheduled without preemption. The objective is to minimise its makespan. For this problem, which is known to be NP-hard in the strong sense, we propose a lower bound based on processor relaxation and show that it is equal to the optimal solution for a preemptive case. We propose two heuristics with a worst-case analysis and its generalisation to any semi-active schedule. A set of dominance properties are established and a branch-and-bound algorithm is developed and tested on a set of randomly generated instances. [Received 29 September 2008; Revised 01 March 2009; Accepted 13 April 2009]

[1]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[2]  Michel X. Goemans,et al.  An Approximation Algorithm for Scheduling on Three Dedicated Machines , 1995, Discret. Appl. Math..

[3]  Jacek Blazewicz,et al.  Scheduling multiprocessor tasks on two parallel processors , 2002, RAIRO Oper. Res..

[4]  Lucio Bianco,et al.  Preemptive multiprocessor task scheduling with release times and time windows , 1997, Ann. Oper. Res..

[5]  Zsolt Tuza,et al.  A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors , 1999, Parallel Comput..

[6]  Lucio Bianco,et al.  Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors , 1994, Perform. Evaluation.

[7]  Jacek Blazewicz,et al.  Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.

[8]  Bozoki George,et al.  A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem , 1970 .

[9]  Zsolt Tuza,et al.  Efficiency and effectiveness of normal schedules on three dedicated processors , 1997, Discret. Math..

[10]  Peter Brucker,et al.  Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems , 1996 .

[11]  Henryk Krawczyk,et al.  An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems , 1985, IEEE Transactions on Computers.

[12]  Jianer Chen,et al.  Semi-normal Schedulings: Improvement on Goemans' Algorithm , 2001, ISAAC.

[13]  Maciej Drozdowski,et al.  Scheduling multiprocessor tasks -- An overview , 1996 .

[14]  Evripidis Bampis,et al.  Scheduling Independent Multiprocessor Tasks , 1997, ESA.

[15]  Evripidis Bampis,et al.  On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.