Semi-online scheduling on a single machine with unexpected breakdown

DOI10.1016/j.tcs.2016.07.014zbMath1348.90276OpenAlexW2502122805MaRDI QIDQ306274

Imed Kacem, Hans Kellerer

Publication date: 31 August 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.014

zbMATH Keywords

competitive analysissemi-online schedulingunexpected breakdown

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (4)

Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown ⋮ Online scheduling with deterioration and unexpected processor breakdown ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints

Cites Work

• Minimizing total weighted completion time with an unexpected machine unavailable interval
• Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
• Improved algorithms for two single machine scheduling problems
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
• Approximation algorithms for single machine scheduling with one unavailability period
• Optimal online algorithm for scheduling on two identical machines with machine availability constraints.

This page was built for publication: Semi-online scheduling on a single machine with unexpected breakdown