Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
From MaRDI portal
(Redirected from Publication:640300)
Recommendations
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Approximation algorithms for single machine scheduling with one unavailability period
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- scientific article; zbMATH DE number 1256760
Cites work
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Algorithms for Scheduling Independent Tasks
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Approximation algorithms for single machine scheduling with one unavailability period
- Fast approximation algorithm for job sequencing with deadlines
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- Improved algorithms for two single machine scheduling problems
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- Lower bounds for tardiness minimization on a single machine with family setup times
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling the maintenance on a single machine
- Scheduling with limited machine availability
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Single machine flow-time scheduling with a single breakdown
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
Cited in
(11)- 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
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Minimizing the maximum lateness for scheduling with release times and job rejection
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
- Scheduling jobs and maintenance activities on parallel machines
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
This page was built for publication: Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640300)
