Scheduling with time-dependent execution times

Research output: Contribution to journalArticleAcademicpeer-review

10 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 languageEnglish
Pages (from-to)155-156
JournalInformation Processing Letters
Volume54
Issue number3
DOIs
Publication statusPublished - 1995

Fingerprint

Dive into the research topics of 'Scheduling with time-dependent execution times'. Together they form a unique fingerprint.

Cite this