On optimal lateness and tardiness scheduling in real-time systems

DOI10.1007/BF02320193zbMath0739.68004MaRDI QIDQ1184690

Alexander D. Stoyenko, Leonidas Georgiadis

Publication date: 28 June 1992

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

time-dependent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Probabilistic games; gambling (91A60)

Related Items (6)

Personalized queues: the customer view, via a fluid model of serving least-patient first ⋮ LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems ⋮ On queues with impatience: stability, and the optimality of earliest deadline first ⋮ On optimal lateness and tardiness scheduling in real-time systems ⋮ Random trees in queueing systems with deadlines ⋮ Convex comparison of service disciplines in real time queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for single machine sequencing with release dates to minimize maximum cost
• On optimal lateness and tardiness scheduling in real-time systems
• On the development of practical nonlinear filters
• Optimal scheduling with strict deadlines
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• A Real-Time System Design Methodology^*
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: On optimal lateness and tardiness scheduling in real-time systems