Maintenance scheduling of rolling stock using a genetic algorithm

Journal of the Operational Research Society

Volumn 49, Issue 11, 1998, Pages 1130-1145

  Sriskandarajah, C ^a   Jardine, A K S ^b   Chan, C K ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Mass Transit Railway Corporation   (Hong Kong)

Author keywords

Genetic algorithms; Maintenance scheduling; Optimisation; Rolling stock

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; OPTIMIZATION; PREVENTIVE MAINTENANCE; PROBLEM SOLVING; RAILROAD ROLLING STOCK; RANDOM PROCESSES; STRATEGIC PLANNING;

LOCAL SEARCH METHODS; MAINTENANCE SCHEDULING;

SCHEDULING;

EID: 0032203407     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600627     Document Type: Article

References (36)

1. Conway RW, Maxwell WL and Miller LW (1967). Theory of Scheduling. Addison-Wesley: Reading Massachusetts.
2. Baker KR (1974). Introduction to Sequencing and Scheduling. Wiley: New York.
3. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1993). Sequencing and scheduling: algorithms and complexity. In Graves SC et al (eds). Handbooks in Operations Research and Management Science 4 North Holland, Amsterdam 445-552.
4. Pinedo M (1995). Scheduling: Theory, Algorithms and Systems. Prentice Hall: New York.
5. Paz NM and Leigh W (1994). Maintenance Scheduling: Issues, Results and Research Needs. Int J Opns and Prod Mgmt 14: 4769.
6. Jardine AKS (1973). Maintenance, Replacement and Reliability. Pitman Publishing: London.
7. Jardine AKS (1979). Solving industrial replacement problems. IEEE Proceedings of the 1979 Annual Reliability and Maintainability Symposium IEEE, New York 136-141.
8. Kralj B and Petrovic R (1988). Optimal preventive maintenance scheduling of thermal generating units in power systems: a survey of problems formulations and solutions methods. Eur J OplRes 35: 1-15.
9. Kralj B and Petrovic R (1995). A multiobjective optimisation approach to thermal generating units maintenance scheduling. Eur J Opl Res 84: 481-493.
10. Escudero LF (1982). On maintenance of production units. Eur J Opl Res 9: 264-274.
11. Hyunchul K, Nara K and Gen M (1994). A method for maintenance scheduling using GA combined with SA. Comp and Indust Engng 27: 477-480.
12. Christer A and Doherty D (1977). Scheduling overhauls of soaking pits. Opns Res Q 28: 915-926.
13. Sule DR and Harmon B (1979). Determination of co-ordinated maintenance scheduling frequencies for a group of machines. AIIE Trans 11: 48-53.
14. Hariga M (1994). A deterministic maintenance-scheduling problem for a group of non-identical machines. Int J Opns and Prod Mgmt 14: 27-36.
15. Duffuaa SO and Ben-Daya M (1994). An extended model for the joint overhaul scheduling problem. Int J Opns and Prod Mgmt 14: 37-43.
16. Chakravarty AK and Balakrishnan N (1995). Impact of job- sequence on the down-time of a deteriorating flexible machine. Eur J Opl Res 87: 299-315.
17. Anily S, Glass C and Hassin R (1994). The scheduling of maintenance service. Report No. OR57, University of Southampton, Faculty of Mathematical Studies, Southampton, UK.
18. Banerjee A and Burton S (1990). Equipment utilization based maintenance task scheduling in a job shop. Eur J Opl Res 45: 191-202.
19. Graham RL, Lawler EL, Lenstra JK and Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5: 287-326.
20. Lawler EL (1977). A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1: 331-342.
21. Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics 1: 343-362.
22. Garey MR and Johnson DS (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Company: New York.
23. Baker KR and Scudder G (1990). Sequencing with earliness and tardiness penalties: A review. Opns Res 38: 22-36.
24. Hall NG and Posner M (1991). Earliness-tardiness scheduling problem i: weighted deviation of the completion times about common due date. Opns Res 39: 836-846.
25. Hall NG, Kubiak W and Sethi SP (1991). Earliness-tardiness scheduling problem ii: deviation of the completion times about a restrictive common due date. Opns Res 39: 847-856.
26. Fry T, Armstrong, R and Blackstone J (1987). Minimizing weighted absolute deviation in single machine scheduling: a Survey. IIE Trans 19: 445-450.
27. Ow P and Morton T (1989). The single machine early-tardy problem. Mgmt Sci 35: 177-191.
28. Dowsland KA (1996). Genetic algorithms-a tool for OR? J Opl ResSoc 47: 550-561.
29. Goldberg DE (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading: Massachusetts.
30. Connolly DT (1992). General purpose simulated annealing. J Opl Res Soc 43: 495-505.
31. Glover F (1989). Tabu Search-Part I. ORSA J on Comput 1: 190-206.
32. Glover F (1990). Tabu Search-Part II. ORSA J on Comput 21: 4-32.
33. Holland JH (1975). Adaptation in Natural and Artificial Systems. The University of Michigan Press: Ann Arbor.
34. Chen CL, Vempati VS and Aljaber N (1995). An application of genetic algorithms for flowshop problems. Eur J Opl Res 80: 389-396.
35. Murata T and Ishibuchi H (1994). Performance evaluation of genetic algorithms for flowshop scheduling problems. In: Proceedings of the IEEE Conference on Genetic Algorithms IEEE, New York 812-817.
36. Davis L (Ed) (1991). Handbook of Genetic Algorithms. van Nostrand Reinhold: New York.