Semi-online scheduling on a single machine with unexpected breakdown
From MaRDI portal
Publication:306274
DOI10.1016/J.TCS.2016.07.014zbMATH Open1348.90276OpenAlexW2502122805MaRDI QIDQ306274FDOQ306274
Authors: 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
Recommendations
Cites Work
- 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
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
- Minimizing total weighted completion time with an unexpected machine unavailable interval
Cited In (6)
- Online single-processor scheduling with an unexpected breakdown
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Online scheduling with deterioration and unexpected processor breakdown
- Title not available (Why is that?)
- 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
This page was built for publication: Semi-online scheduling on a single machine with unexpected breakdown
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306274)