A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan"

European Journal of Operational Research

Volumn 197, Issue 2, 2009, Pages 825-827

  Xu, Dehua ^a   Yin, Yunqiang ^a   Li, Hongxing ^b  

^a BEIJING NORMAL UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Heuristic algorithm; Maintenance; Scheduling; Single machine; Worst case analysis

Indexed keywords

APPROXIMATION ALGORITHMS; HEURISTIC METHODS; MAINTAINABILITY; POLYNOMIAL APPROXIMATION; PORTALS; SCHEDULING; SCHEDULING ALGORITHMS;

COMPUTATIONAL RESULTS; FLEXIBLE MAINTENANCES; MAKESPAN; OPERATIONAL RESEARCHES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; SCHEDULING PROBLEMS; SINGLE MACHINE; WORST-CASE ANALYSIS; WORST-CASE PERFORMANCE;

HEURISTIC ALGORITHMS;

EID: 60649111057     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.07.021     Document Type: Article

References (20)

1. Breit J. Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. European Journal of Operational Research 183 (2007) 516-524
2. Chen J.S. Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan. European Journal of Operational Research 190 (2008) 90-102
3. Cheng T.C.E., and Wang G. Two-machine flowshop scheduling with consecutive availability constraints. Information Processing Letters 71 (1999) 49-54
4. Cheng T.C.E., and Wang G. An improved heuristic for two-machine flowshop scheduling with an availability constraint. Operations Research Letters 26 (2000) 223-229
5. Chu C., and La R. Variable-sized bin packing: tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing 30 (2001) 2069-2083
6. Coffman Jr. E.G., Garey M.R., and Johnson D.S. Approximation algorithms for bin packing: a survey. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Company, Boston 46-93
7. Gawiejnowicz S. Scheduling deteriorating jobs subject to job or machine availability constraints. European Journal of Operational Research 180 (2007) 472-478
8. Ji M., He Y., and Cheng T.C.E. Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research 34 (2007) 1764-1770
9. Kacem I. Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering 54 (2008) 401-410
10. I. Kacem, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval, Journal of Combinatorial Optimization, doi:10.1007/s10878-007-9102-4.
11. Lee C.Y. Machine scheduling with an availability constraint. Journal of Global Optimization 9 (1996) 395-416
12. Liao L.W., and Sheen G.J. Parallel machine scheduling with machine availability and eligibility constraints. European Journal of Operational Research 184 (2008) 458-467
13. Liao C.J., Shyur D.L., and Lin C.H. Makespan minimization for two parallel machines with an availability constraint. European Journal of Operational Research 160 (2005) 445-456
14. Qi X. A note on worst-case performance of heuristics for maintenance scheduling problems. Discrete Applied Mathematics 155 (2007) 416-422
15. Wang G., and Cheng T.C.E. Heuristics for two-machine no-wait flowshop scheduling with an availability constraint. Information Processing Letters 80 (2001) 305-309
16. Wang X., and Cheng T.C.E. Machine scheduling with an availability constraint and job delivery coordination. Naval Research Logistics 54 (2007) 11-20
17. Wang X., and Cheng T.C.E. Heuristics for two-machine flowshop scheduling with setup times and an availability constraint. Computers & Operations Research 34 (2007) 152-162
18. D. Xu, Z. Cheng, Y. Yin, H. Li, Makespan minimization for two parallel machines scheduling with a periodic availability constraint, Computers & Operations Research, doi:10.1016/j.cor.2008.05.001.
19. Xu D., Sun K., and Li H. Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Computers & Operations Research 35 (2008) 1344-1349
20. D. Xu, Y. Yin, H. Li, Scheduling jobs under increasing linear machine maintenance time, Journal of Scheduling, doi:10.1007/s10951-008-0057-9.