Approximation Algorithms for Scheduling with a Variable Machine Maintenance

DOI10.1007/978-3-642-14355-7_22zbMath1286.90061OpenAlexW1484328130MaRDI QIDQ3578376

Lin Chen, Wen-Chang Luo, Guo-Chuan 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 algorithmstotal weighted completion timescheduling with maintenance

Mathematics Subject Classification ID

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

Related Items (3)

Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness ⋮ On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs ⋮ Single-machine scheduling with job-dependent machine deterioration

This page was built for publication: Approximation Algorithms for Scheduling with a Variable Machine Maintenance