Advertisement

Approximation Algorithms for Scheduling with a Variable Machine Maintenance

  • Wenchang Luo
  • Lin Chen
  • Guochuan Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)

Abstract

In this paper, we investigate the problem of scheduling weighted jobs on a single machine with a maintenance whose starting time is prior to a given deadline and whose duration is a nondecreasing function of the starting time. We are asked not only to schedule the jobs but also the maintenance such that the total weighted job completion time is minimum. The problem is shown to be weakly NP-hard. In the case that the duration of the maintenance is a concave (and nondecreasing) function of its starting time, we provide two approximation algorithms with approximation ratio of 2 and at most \(1+\sqrt{2}/2+\epsilon\), respectively.

Keywords

Approximation algorithms scheduling with maintenance total weighted completion time 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Operations Research 52, 229–242 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Fu, B., Huo, Y., Zhao, H.: Exponential inapproximability and FPTAS for scheduling with availability constraints. Theoretical Computer Science 410, 2663–2674 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Gens, G., Levner, E.: Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics 3, 313–318 (1981)zbMATHCrossRefGoogle Scholar
  4. 4.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kacem, I.: Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers and Industrial Engineering 54, 401–410 (2008)CrossRefGoogle Scholar
  6. 6.
    Kellerer, H., Kubzin, M.A., Strusevich, V.A.: Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval. European Journal of Operational Research 199, 111–116 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Kellerer, H., Strusevich, V.A.: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica (2009), doi:10.1007/s00453-008-9248-1Google Scholar
  8. 8.
    Kubzin, M.A., Strusevich, V.A.: Planning machine maintenance in two-machine shop scheduling. Operations Research 54, 789–800 (2006)zbMATHCrossRefGoogle Scholar
  9. 9.
    Lee, C.-Y., Chen, Z.: Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics 47, 145–165 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Ma, Y., Chu, C., Zuo, C.: A survey of scheduling with deterministic machine availability constraints. Computers and Industrial Engineering (2009), doi:10.1016/j.cie.2009.04.014Google Scholar
  11. 11.
    Megow, N., Verschae, J.: Short note on scheduling on a single machine with one non-availability period (2009) (manuscript)Google Scholar
  12. 12.
    Mosheiov, G., Sarig, A.: Scheduling a maintenance activity to minimize total weighted completion-time. Computers and Mathematics with Applications 57, 619–623 (2009)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Mosheiov, G., Sidney, J.B.: Scheduling a deteriorating maintenance activity on a single machine. Journal of the Operational Research Society (2009), doi:10.1057/jors.2009.5Google Scholar
  14. 14.
    Schmidt, G.: Scheduling with limited machine availability. European Journal of Operational Research 121, 1–15 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Wang, G., Sun, H., Chu, C.: Preemptive scheduling with availability constraints to minimize total weighted completion times. Annals of Operations Research 133, 183–192 (2005)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Wenchang Luo
    • 1
    • 2
  • Lin Chen
    • 1
  • Guochuan Zhang
    • 3
  1. 1.Department of MathematicsZhejiang UniversityHangzhouChina
  2. 2.Faculty of ScienceNingbo UniversityNingboChina
  3. 3.College of Computer ScienceZhejiang UniversityHangzhouChina

Personalised recommendations