Exponential inapproximability and FPTAS for scheduling with availability constraints
From MaRDI portal
Publication:1029337
DOI10.1016/J.TCS.2009.03.012zbMATH Open1188.68083OpenAlexW2005313518MaRDI QIDQ1029337FDOQ1029337
Authors: Bin Fu, Yumei Huo, Hairong Zhao 
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.012
Recommendations
- Approximation schemes for scheduling with availability constraints
- Approximation schemes for parallel machine scheduling with availability constraints
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- Makespan Minimization with Machine Availability Constraints
- A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single machine flow-time scheduling with a single breakdown
- Machine scheduling with availability constraints
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Scheduling with limited machine availability
- Single machine flow-time scheduling with scheduled maintenance
- Current trends in deterministic scheduling
- Scheduling preemptable tasks on parallel processors with limited availability
- Machine scheduling with an availability constraint
- Parallel machine scheduling with machine availability and eligibility constraints
- Scheduling jobs and maintenance activities on parallel machines
- Two-machine flow shops with limited machine availability
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
- Approximation results for flow shop scheduling problems with machine availability constraints
- Non-preemptive two-machine open shop scheduling with non-availability constraints
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
Cited In (8)
- Single machine scheduling with semi-resumable machine availability constraints
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- Parallel machines scheduling with machine maintenance for minsum criteria
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Approximation schemes for scheduling with availability constraints
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Approximation schemes for parallel machine scheduling with availability constraints
This page was built for publication: Exponential inapproximability and FPTAS for scheduling with availability constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029337)
