A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
From MaRDI portal
Recommendations
- Machine scheduling with availability constraints
- Multiprocessor scheduling with availability constraints
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS
- Approximation schemes for scheduling with availability constraints
- Approximation schemes for parallel machine scheduling with availability constraints
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 871909 (Why is no real title available?)
- scientific article; zbMATH DE number 1394810 (Why is no real title available?)
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- A 3/4-approximation algorithm for multiple subset sum
- A PTAS for the multiple subset sum problem with different knapsack capacities
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A near-optimal solution to a two-dimensional cutting stock problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- A note on parallel machine scheduling with non-simultaneous machine available time
- Algorithms for Scheduling Independent Tasks
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Approximability of scheduling with fixed jobs
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for scheduling with reservations
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Approximation algorithms for the multiple knapsack problem with assignment restrictions
- Approximation in Preemptive Stochastic Online Scheduling
- Bin packing can be solved within 1+epsilon in linear time
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fault-Tolerant Scheduling
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Makespan minimization for two parallel machines with an availability constraint
- Minimizing makespan on a single machine subject to random breakdowns
- Nearly on line scheduling of preemptive independent tasks
- On the two-phase method for preemptive scheduling
- Online scheduling on semi-related machines
- Parallel machines scheduling with nonsimultaneous machine available time
- Parallel-machine scheduling under potential disruption
- Parameterized approximation scheme for the multiple knapsack problem
- Preemptive scheduling with staircase and piecewise linear resource availability
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling with deadlines and loss functions
- Scheduling with unexpected machine breakdowns
- Single machine flow-time scheduling with a single breakdown
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities
- The effect of machine availability on the worst-case performance of LPT
- The multiple subset sum problem
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
- `` Strong NP-Completeness Results
Cited in
(8)- Solving the online on-demand warehousing problem
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Dual techniques for scheduling on a machine with varying speed
- Speed-robust scheduling. Sand, bricks, and rocks
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Speed-robust scheduling: sand, bricks, and rocks
- Scheduling on a stochastic number of machines
- Speed-robust scheduling revisited
This page was built for publication: A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637311)
