Scheduling with time-dependent execution times

G.J. Woeginger

doi:10.1016/0020-0190(95)00011-Z

Scheduling with time-dependent execution times

G.J. Woeginger

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

1 Downloads (Pure)

Abstract

We consider systems of tasks where the task execution times are time-dependent and where all tasks have some common deadline. We describe how to compute in polynomial time a schedule that minimizes the number of late tasks. This answers a question raised in a recent paper by Ho, Leung and Wei.

Original language	English
Pages (from-to)	155-156
Journal	Information Processing Letters
Volume	54
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(95)00011-Z
Publication status	Published - 1995

Access to Document

10.1016/0020-0190(95)00011-Z

Cite this

@article{011c7d0d3afd4a7c8a9b028556e32eb5,

title = "Scheduling with time-dependent execution times",

abstract = "We consider systems of tasks where the task execution times are time-dependent and where all tasks have some common deadline. We describe how to compute in polynomial time a schedule that minimizes the number of late tasks. This answers a question raised in a recent paper by Ho, Leung and Wei.",

author = "G.J. Woeginger",

year = "1995",

doi = "10.1016/0020-0190(95)00011-Z",

language = "English",

volume = "54",

pages = "155--156",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Scheduling with time-dependent execution times

AU - Woeginger, G.J.

PY - 1995

Y1 - 1995

N2 - We consider systems of tasks where the task execution times are time-dependent and where all tasks have some common deadline. We describe how to compute in polynomial time a schedule that minimizes the number of late tasks. This answers a question raised in a recent paper by Ho, Leung and Wei.

AB - We consider systems of tasks where the task execution times are time-dependent and where all tasks have some common deadline. We describe how to compute in polynomial time a schedule that minimizes the number of late tasks. This answers a question raised in a recent paper by Ho, Leung and Wei.

U2 - 10.1016/0020-0190(95)00011-Z

DO - 10.1016/0020-0190(95)00011-Z

M3 - Article

SN - 0020-0190

VL - 54

SP - 155

EP - 156

JO - Information Processing Letters

JF - Information Processing Letters

IS - 3

ER -

Scheduling with time-dependent execution times

Abstract

Access to Document

Fingerprint

Cite this