Nearly on line scheduling of preemptive independent tasks

DOI10.1016/0166-218X(94)00105-MzbMath0830.68011OpenAlexW2064603299MaRDI QIDQ1346697

Eric Sanlaville

Publication date: 10 April 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00105-m

zbMATH Keywords

schedulingpolynomial-time algorithmsperformance guarantee

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (6)

Parallel machine scheduling with machine availability and eligibility constraints ⋮ Scheduling with limited machine availability ⋮ Scheduling with unexpected machine breakdowns ⋮ Jackson's pseudo-preemptive schedule and cumulative scheduling problems ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• NP-complete scheduling problems
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling with Deadlines and Loss Functions
• Scheduling on semi-identical processors
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Flat Graphs
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Preemptive Scheduling with Due Dates
• A New Algorithm for Preemptive Scheduling of Trees
• Some simple scheduling algorithms
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: Nearly on line scheduling of preemptive independent tasks