Scheduling multiprocessor UET tasks of two sizes

Authors:
Tamás Kis
Affiliations:
Computer and Automation Research Institute, Kende str. 13-17, Budapest, Hungary
Venue:
Theoretical Computer Science
Year:
2009

Citing 5
Cited 0

Scheduling Multiprocessor Tasks to Minimize Schedule Length

IEEE Transactions on Computers
Theory of linear and integer programming

Theory of linear and integer programming
On maximizing the throughput of multiprocessor tasks

Theoretical Computer Science
A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness

Journal of Scheduling
Computational complexity of some scheduling problems with multiprocessor tasks

Discrete Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper we study task scheduling problems on m identical parallel processors, where each task has unit execution time, and needs either a single processor, or q processors concurrently, and it has a release date and a due date. Under the assumption that the release dates and due dates of the q-processor tasks are agreeable, we describe a polynomial time algorithm for minimising the number of tardy tasks. In addition, we apply this result for minimising the maximum lateness, and the maximum tardiness. We also discuss the combinatorial background of the polynomial time solvability of all these problems under the 'agreeable' assumption.