Approximation algorithms for single machine scheduling with one unavailability period
From MaRDI portal
Recommendations
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- 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
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A comment on scheduling two parallel machines with capacity constraints
- Algorithms for Scheduling Independent Tasks
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast approximation algorithm for job sequencing with deadlines
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Machine scheduling with an availability constraint
- New single machine and job-shop scheduling problems with availability constraints
- Scheduling with limited machine availability
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(19)- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- Approximation algorithms for inventory constrained scheduling on a single machine
- scientific article; zbMATH DE number 5007490 (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
- Semi-online scheduling on a single machine with unexpected breakdown
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling jobs and maintenance activities on parallel machines
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- Online scheduling with deterioration and unexpected processor breakdown
This page was built for publication: Approximation algorithms for single machine scheduling with one unavailability period
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1022445)
