Semi-online scheduling on a single machine with unexpected breakdown
From MaRDI portal
Publication:306274
Recommendations
Cites work
- 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
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Improved algorithms for two single machine scheduling problems
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints.
Cited in
(6)- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- scientific article; zbMATH DE number 1418278 (Why is no real title available?)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Online single-processor scheduling with an unexpected breakdown
- Online scheduling with deterioration and unexpected processor 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)