Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
From MaRDI portal
(Redirected from Publication:326506)
Recommendations
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval
- 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
Cites work
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Algorithms for Scheduling Independent Tasks
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast approximation algorithm for job sequencing with deadlines
- Improved algorithms for two single machine scheduling problems
- Machine scheduling with an availability constraint
- Operator non-availability periods
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
- Scheduling the maintenance on a single machine
- Scheduling with limited machine availability
- Single machine scheduling with small operator-non-availability periods
- The one-machine sequencing problem
Cited in
(11)- Minimizing maximum delivery completion time for order scheduling with rejection
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Approximation algorithms for single machine scheduling with one unavailability period
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Single-machine scheduling with operator non-availability to minimize total weighted completion time
- Minimizing the maximum lateness for scheduling with release times and job rejection
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
- Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
This page was built for publication: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326506)
