Minimizing the weighted number of tardy task units
type: Item
instance of: scholarly article
title: Minimizing the weighted number of tardy task units
zbMATH Open document ID: 0811.68063
DOI: 10.1016/0166-218X(92)00037-M
author: V. Pereyra
published in: Discrete Applied Mathematics
publication date: 1994-07-31T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 612415
zbMATH Keywords: preemptive schedule
zbMATH Keywords: feasible schedule
zbMATH Keywords: imprecise computation
zbMATH Keywords: tardy task
MaRDI profile type: Publication
cites work: Q3680271
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Minimizing the number of tardy job units under release time constraints
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints
description: scientific article; zbMATH DE number 612415