Approximation algorithms for scheduling with a variable machine maintenance

DOI10.1007/978-3-642-14355-7_22MaRDI QIDQ3578376zbMATH OpenOpenAlexFDO

Authors Lin Chen, Wenchang Luo, Guochuan Zhang

Publication date 20 July 2010

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14355-7_22

zbMATH Keywords

approximation algorithmsscheduling with maintenancetotal weighted completion time

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximation algorithms for the single-machine scheduling with a period of maintenance
• Scheduling a variable maintenance and linear deteriorating jobs on a single machine
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs
• Scheduling a maintenance activity to minimize total weighted completion-time
• Scheduling jobs under increasing linear machine maintenance time

Cited in

(5)

• Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness
• Maintenance scheduling problems as benchmarks for constraint algorithms
• On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs
• Single-machine scheduling with job-dependent machine deterioration
• Scheduling jobs under increasing linear machine maintenance time

This page was built for publication: Approximation algorithms for scheduling with a variable machine maintenance

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