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
Publication:640300
DOI10.1007/s10951-009-0146-4zbMath1222.90016OpenAlexW1996513144MaRDI QIDQ640300
Publication date: 18 October 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0146-4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Scheduling jobs and maintenance activities on parallel machines ⋮ Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ 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 ⋮ Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
Cites Work
- Unnamed Item
- Improved algorithms for two single machine scheduling problems
- A note on worst-case performance of heuristics for maintenance 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
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- Single machine flow-time scheduling with a single breakdown
- Fast approximation algorithm for job sequencing with deadlines
- Scheduling with release dates on a single machine to minimize total weighted completion time
- Improved dynamic programming in connection with an FPTAS for the knapsack problem
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Scheduling the maintenance on a single machine
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Algorithms for Scheduling Independent Tasks
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
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
