An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs

DOI10.3934/JIMO.2016.12.811zbMATH Open1331.90027OpenAlexW2524755176MaRDI QIDQ898702FDOQ898702

Authors: Imed Kacem, Eugene Levner 

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

Recommendations

• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
• Scheduling a variable maintenance and linear deteriorating jobs on a single machine
• Approximation scheme for scheduling resumable proportionally deteriorating jobs
• Scheduling a deteriorating maintenance activity on a single machine

zbMATH Keywords

schedulingdeteriorating jobsapproximation schemetotal completion timemaintenance activities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Fast approximation algorithm for job sequencing with deadlines
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Time-dependent scheduling
• Machine scheduling with an availability constraint
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem

Cited In (6)

• A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing
• Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems

This page was built for publication: An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898702)