By Topic

Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoqiang Cai ; Dept. of Syst. Eng., Chinese Univ. of Hong Kong, Shatin, China ; Chung-Yee Lee ; Tin-Lam Wong

We consider a scheduling problem with two parallel processors, where one task may need the processing of more than one processor simultaneously. Alternatives are available to allocate processors to process a task. Under a given alternative, a task is assigned to some specific processor(s), and requires correspondingly a specific processing time. Task preemption is allowed. The problem is to minimize the maximum tardiness of task completion times from their due dates, through determining the following: 1) the optimal assignment of each task to processor(s) and 2) the optimal schedule for each processor to process the tasks assigned to it. We present a two-stage approach, which can generate an optimal solution in pseudopolynomial time. We also apply/extend the two-stage approach to other problems where the number of processors required by each task is prespecified, preemption is prohibited, and the total completion time is to be minimized

Published in:

IEEE Transactions on Robotics and Automation  (Volume:16 ,  Issue: 6 )