Minimizing the weighted number of tardy task units

DOI10.1016/0166-218X(92)00037-MzbMath0811.68063MaRDI QIDQ1329790

V. Pereyra

Publication date: 31 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

preemptive scheduleimprecise computationfeasible scheduletardy task

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

Scheduling imprecise computation tasks on uniform processors ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Scheduling imprecise computation tasks with \(0/1\)-constraint ⋮ Pre-emptive scheduling problems with controllable processing times ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach ⋮ Preemptive scheduling on uniform parallel machines with controllable job processing times ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS ⋮ IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS ⋮ Scheduling two agents with controllable processing times ⋮ Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines ⋮ Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

Cites Work

• Unnamed Item
• Minimizing mean weighted execution time loss on identical and uniform processors
• Minimizing the number of tardy job units under release time constraints
• A linear-time algorithm for a special case of disjoint set union
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Single Machine Scheduling to Minimize Total Late Work

This page was built for publication: Minimizing the weighted number of tardy task units