An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters

Volumn 108, Issue 4, 2008, Pages 171-174

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

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Eligibility; Grade of service; Makespan; Scheduling

Indexed keywords

SCHEDULING; WIRELESS TELECOMMUNICATION SYSTEMS;

ELIGIBILITY; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; GRADE OF SERVICE; MACHINE SCHEDULING; MACHINE-SCHEDULING PROBLEMS; MAKESPAN; SERVICE REQUESTS;

POLYNOMIAL APPROXIMATION;

EID: 52049106371     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.04.021     Document Type: Article

References (9)

1. 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 Discrete Mathematics 5 (1979) 287-326
2. Hwang H.C., Chang S.Y., and Lee K. Parallel machine scheduling under a grade of service provision. Computers & Operations Research 31 (2004) 2055-2061
3. Ji M., and Cheng T.C.E. An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Information Processing Letters 102 (2007) 41-47
4. Ji M., and Cheng T.C.E. Parallel-machine scheduling with simple linear deterioration to minimize total completion time. European Journal of Operational Research 188 (2008) 342-347
5. Jiang Y.W. Online scheduling on parallel machines with two GoS levels. Lecture Notes in Computer Science 4041 (2006) 11-21
6. Jiang Y.W., He Y., and Tang C.M. Optimal online algorithms for scheduling on two identical machines under a grade of service. Journal of Zhejiang University-Science A 7 (2006) 309-314
7. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. Journal of Heuristics 3 (1998) 287-297
8. Kovalyov M.Y., and Kubiak W. A fully polynomial approximation scheme for the weighted earliness-tardiness problem. Operations Research 47 (1999) 757-761
9. Park J., Chang S.Y., and Lee K. Online and semi-online scheduling of two machines under a grade of service provision. Operations Research Letters 34 (2006) 692-696