Minimizing the weighted number of tardy task units

Joseph Y.T. Leung, Vincent K.M. Yu, W. D. Wei

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

The problem of minimizing the weighted number of tardy task units on a single processor is considered. We give an O(n log n + kn)-time algorithm for a set of n tasks with k distinct weights. The relation of this problem with that of minimizing the total weighted error in the imprecise computation model is also discussed.

Original languageEnglish (US)
Pages (from-to)307-316
Number of pages10
JournalDiscrete Applied Mathematics
Volume51
Issue number3
DOIs
StatePublished - Jul 6 1994
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Keywords

  • Feasible schedule
  • Imprecise computation
  • Late task
  • On-time task
  • Preemptive schedule
  • Single processor
  • Tardy task units

Fingerprint

Dive into the research topics of 'Minimizing the weighted number of tardy task units'. Together they form a unique fingerprint.

Cite this