Scheduling multiprocessor UET tasks of two sizes

Research output: Contribution to journalArticle

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,wedescribe 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.

Original languageEnglish
Pages (from-to)4864-4873
Number of pages10
JournalTheoretical Computer Science
Volume410
Issue number47-49
DOIs
Publication statusPublished - Nov 6 2009

Fingerprint

Multiprocessor Scheduling
Release Dates
Due Dates
Scheduling
Polynomials
Maximum Lateness
Parallel Processors
Tardiness
Task Scheduling
Polynomial-time Algorithm
Execution Time
Solvability
Scheduling Problem
Polynomial time
Unit
Background

Keywords

  • Matching theory
  • Network matrices
  • Scheduling UET tasks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Scheduling multiprocessor UET tasks of two sizes. / Kis, Tamás.

In: Theoretical Computer Science, Vol. 410, No. 47-49, 06.11.2009, p. 4864-4873.

Research output: Contribution to journalArticle

@article{c5a60f62b4a24f118c437ece04d4b069,
title = "Scheduling multiprocessor UET tasks of two sizes",
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,wedescribe 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.",
keywords = "Matching theory, Network matrices, Scheduling UET tasks",
author = "Tam{\'a}s Kis",
year = "2009",
month = "11",
day = "6",
doi = "10.1016/j.tcs.2009.06.027",
language = "English",
volume = "410",
pages = "4864--4873",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "47-49",

}

TY - JOUR

T1 - Scheduling multiprocessor UET tasks of two sizes

AU - Kis, Tamás

PY - 2009/11/6

Y1 - 2009/11/6

N2 - 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,wedescribe 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.

AB - 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,wedescribe 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.

KW - Matching theory

KW - Network matrices

KW - Scheduling UET tasks

UR - http://www.scopus.com/inward/record.url?scp=84858702232&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858702232&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.06.027

DO - 10.1016/j.tcs.2009.06.027

M3 - Article

VL - 410

SP - 4864

EP - 4873

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 47-49

ER -