An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
From MaRDI portal
Publication:898702
DOI10.3934/jimo.2016.12.811zbMath1331.90027OpenAlexW2524755176MaRDI QIDQ898702
Publication date: 18 December 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.811
Related Items (5)
Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs ⋮ Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing
Cites Work
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
- Fast approximation algorithm for job sequencing with deadlines
- Approximation schemes for scheduling a maintenance and linear deteriorating jobs
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Machine scheduling with an availability constraint
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
This page was built for publication: An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
