Scheduling with unexpected machine breakdowns

DOI10.1016/S0166-218X(00)00266-3zbMath1074.90523OpenAlexW2082265268WikidataQ126803169 ScholiaQ126803169MaRDI QIDQ5936454

Susanne Albers, Günter Schmidt

Publication date: 31 October 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00266-3

zbMATH Keywords

LookaheadMachine breakdownOnline algorithmScheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (8)

Uncertain flexible flow shop scheduling problem subject to breakdowns ⋮ Modeling of a scheduling problem with expected availability of resources ⋮ Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms ⋮ Speed-robust scheduling: sand, bricks, and rocks ⋮ Static worksharing strategies for heterogeneous computers with unrecoverable interruptions ⋮ Online scheduling on semi-related machines ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Speed-robust scheduling. Sand, bricks, and rocks

Cites Work

• Machine scheduling with availability constraints
• Nearly on line scheduling of preemptive independent tasks
• Scheduling with Deadlines and Loss Functions
• Fault-tolerant scheduling
• Scheduling on semi-identical processors
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Fault-tolerant real-time scheduling

This page was built for publication: Scheduling with unexpected machine breakdowns