Single-machine scheduling with periodic maintenance to minimize makespan

Computers and Operations Research

Volumn 34, Issue 6 SPEC. ISS., 2007, Pages 1764-1770

  Ji, Min ^a,b   He, Yong ^a   Cheng, T C E ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Approximation algorithm; Non approximability; Nonresumable jobs; Periodic maintenance; Single machine scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MAINTENANCE; POLYNOMIALS; SCHEDULING;

APPROXIMATION ALGORITHMS; NONRESUMABLE JOBS; PERIODIC MAINTENANCE; SINGLE MACHINE SCHEDULING;

PRODUCTION ENGINEERING;

EID: 33749681702     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.05.034     Document Type: Article

References (13)

1. Art R.H.P.M., Knapp G.M., and Lawrence M.J. Some aspects of measuring maintenance in the process industry. Journal of Quality in Maintenance Engineering 4 (1998) 6-11
2. Liao C.J., and Chen W.J. Single-machine scheduling with periodic maintenance and nonresumable jobs. Computers and Operations Research 30 (2003) 1335-1347
3. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Operations Research 5 (1979) 287-326
4. Lee C.Y. Machine scheduling with an availability constraint. Journal of Global Optimization 9 (1996) 395-416
5. He Y., Ji M., and Cheng T.C.E. Single machine scheduling with a restricted rate-modifying activity. Naval Research Logistics 52 (2005) 361-369
6. Lee C.Y., and Liman S.D. Single machine flow-time scheduling with scheduled maintenance. Acta Informatica 29 (1992) 375-382
7. Sadfi C., Penz B., Rapine C., Błazewicz J., and Formanowicz P. An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research 161 (2005) 3-10
8. He Y., Zhong W.Y., and Gu H.K. Improved algorithms for two single machine scheduling problems, AAIM 2005. Lecture Notes in Computer Science 3521 (2005) 66-76
9. Graves G.H., and Lee C.Y. Scheduling maintenance and semiresumable jobs on a single machine. Naval Research Logistics 46 (1999) 845-863
10. Schmidt G. Scheduling with limited machine availability. European Journal of Operational Research 121 (2000) 1-15
11. Simchi-Levi D. New worst-case results for the bin packing problem. Naval Research Logistics 41 (1994) 579-585
12. Baase S., and Gelder A.V. Computer algorithms: introduction to design and analysis. 3rd ed. (2000), Addison-Wesley, USA
13. Garey M.R., and Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman and Company, New York