Application of genetic algorithms in production and operations management: A review

International Journal of Production Research

Volumn 43, Issue 19, 2005, Pages 4083-4101

  Chaudhry, S S ^a   Luo, W ^a  

^a VILLANOVA UNIVERSITY   (United States)

Author keywords

Genetic algorithms; Production and operations management; Survey

Indexed keywords

GENETIC ALGORITHMS; PUBLISHING; SURVEYS;

OPERATIONS MANAGEMENT; PRODUCTION MANAGEMENT;

PRODUCTION ENGINEERING;

EID: 27844503922     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500143199     Document Type: Review

References (197)

1. References Aytug, H., Khouja, M. and Vergara, F.E., Use of genetic algorithms to solve production and operations management problems: a review. Int. J. Prod. Res., 2003, 41, 3955-4009.
2. Barman, S., Hanna, M.D. and Laforge, R.L., Perceived relevance and quality of POM journals: a decade later. J. Op. Manage., 2001, 19, 367-385.
3. Chase, R.B., Aquilano, N.J. and Jacobs, F.R., Operations Management for Competitive Advantage, 9th ed., 2001 (McGraw-Hill Irwin: New York, NY).
4. Chaudhry, S.S., Varano, M.W. and Xu, L., Systems research, genetic algorithms, and information systems. Syst. Res. & Behav. Sci., 2000, 17, 149-162.
5. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop scheduling problems using genetic algorithms. I. Representation. Computers & Indust. Eng., 1996, 30, 983-997.
6. Dowsland, K.A., Genetic algorithms - A tool for OR? J. Op. Res. Soc., 1996, 47, 550-561.
7. Evolver, 1998 (Palisade Corporation: Newfield, NY).
8. GeneHunter, 1995 (Ward Systems Group, Inc.: Frederick, MD).
9. Goh, C.-H., Holsapple, C.W., Johnson, L.E. and Tanner, J.R., Evaluating and classifying POM journals. J. Op. Manage., 1997, 15, 123-138.
10. Goldberg D., Genetic Algorithms in Search, Optimisation, and Machine Learning, 1989 (Addison-Wesley: Reading, MA).
11. Gupta, Y.P. and Chin, D.C.W., Expert systems and their applications in production and operations management. Computers & Op. Res., 1989, 16, 567-582.
12. Holland, J., Adaptation in Natural and Artificial Systems, 1975 (University of Michigan Press: Ann Arbor, MI).
13. Jayaraman, V. and Srivastava, R., Expert systems in production and operations management: current applications and future prospects. Int. J. Op. & Prod. Manage., 1996, 16, 27-44.
14. Mertens, P. and Kanet, J.J., Expert systems in production management: an assessment. J. Op. Manage., 1986, 6, 393-404.
15. Morton, T.E. and Pentico, D.W., Heuristic Scheduling Systems with Applications to Production Systems and Project Management, 1993 (John Wiley and Sons: New York, NY).
16. Proudlove, N.C., Vadera, S. and Kobbacy, K.A.H., Intelligent management systems in operations: a review. J. Op. Res. Soc., 1998, 49, 682-699.
17. Riggs, R.L., Production Systems: Planning, Analysis and Control, 1996 (John Wiley and Sons: New York, NY).
18. Schroeder, R.G., Operations Management: Decision Making in the Operations Function, 4th ed., 1993 (McGraw-Hill: New York, NY).
19. Soteriou, A.C., Hadjinicola, G.C. and Patsia, K., Assessing production and operations management related journals: the European perspective. J. Op. Manage., 1999, 17, 225-238.
20. Bibliography Abboud, N., Inuiguchi, M., Sakawa, M. and Uemura, Y., Manpower allocation using genetic annealing. Euro. J. Op. Res., 1998, 111(2), 405-421.
21. Abdinnour-Helm, S., A hybrid heuristic for the uncapacitated hub location problem. Euro. J. Op. Res., 1998, 106(2,3), 489-500.
22. Al-Hakim, L., A note on a genetic algorithm approach for multiple criteria facility layout design. Int. J. Prod. Res., 2000, 38(4), 985-989.
23. Al-Hakim, L., On solving facility layout problems using genetic algorithms. Int. J. Prod. Res., 2000, 38(11), 2573-2582.
24. Al-Hakim, L., An analogue genetic algorithm for solving job shop scheduling problems. Int. J. Prod. Res., 2001, 39(7), 1537-1548.
25. Arzi, Y., Bukchin, J. and Masin, M., An efficiency frontier approach for the design of cellular manufacturing systems in a lumpy demand environment. Euro. J. Op. Res., 2001, 134(2), 346-264.
26. Awadh, B., Sepehri, N. and Hawaleshka, O., A computer-aided process planning model based on genetic algorithms. Computers & Op. Res., 1995, 22(8), 841-856.
27. Aytug, H., Koehler, G.J. and Snowdon, J.L., Genetic learning of dynamic scheduling within a simulation environment. Computers & Op. Res., 1994, 21(8), 909-925.
28. Azadivar, F. and Tompkins, G., Simulation optimisation with qualitative variables and structural model changes: a genetic algorithm approach. Euro. J. Op. Res., 1999, 113(1), 169-183.
29. Azadivar, F. and Wang, J., Facility layout optimisation using simulation and genetic algorithms. Int. J. Prod. Res., 2000, 38(17), 4369-4383.
30. Babu, A.R. and Babu, N.R., Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Int. J. Prod. Res., 1999, 37(7), 1625-1643.
31. Backhouse, P.G., Fotheringham, A.F. and Allan, G., A comparison of a genetic algorithm with an experimental design technique in the optimisation of a production process. J. Op. Research Society, 1997, 48(3), 247-256.
32. Balakrishnan, J. and Chen, C.H., Genetic search and the dynamic layout problem. Computers & Op. Res., 2000, 27, 587-593.
33. Balakrishnan, P.V. and Jacob, V.S., Genetic algorithms for product design. Manage. Sci., 1996, 42(8), 1105-1118.
34. Bhaskara Reddy, S.V., Shunmugam, M.S. and Narendran, T.T., Operation sequencing in CAPP using genetic algorithms. Int. J. Prod. Res., 1999, 37(5), 1063-1074.
35. Bhattacharyya, S. and Koehler, G.J., Learning by objectives for adaptive shop-floor scheduling. Decision Sci., 1998, 29(2), 347-376.
36. Biegel, J.E. and Davern, J.J., Genetic Algorithms and Job Shop Scheduling. Computers & Ind. Eng., 1990, 19, 81-91.
37. Bowden, R. and Bullington, S.F., Development of manufacturing control strategies using unsupervised machine learning. IIE Trans., 1996, 28, 319-331.
38. Brown, E.C. and Sumichrast, R.T., CF-GGA: a grouping algorithm for the cell formation problem. Int. J. Prod. Res., 2001, 39(16), 3651-3669.
39. Bulgak, A.A., Diwan, P.D. and Inozu, B., Buffer size optimisation in asynchronous assembly systems using genetic algorithms. Computers & Ind. Eng., 1995, 28(2), 309-322.
40. Cai, X. and Li, K.N., A genetic algorithm for scheduling staff of mixed skills under multicriteria. Euro. J. Op. Res., 2000, 125(2), 359-369.
41. Candido, M.A.B., Khator, S.K. and Barcia, R.M., A genetic algorithm based procedure for more realistic job shop scheduling problems. Int. J. Prod. Res., 1998, 36(12), 3437-3457.
42. Caraffa, V., Ianes, S., Bagchi, T.P. and Sriskandarajah, C., Minimising makespan in a blocking flowshop using genetic algorithms. Int. J. Prod. Econ., 2001, 70(2), 101-115.
43. Carnahan, B.J., Norman, B.A. and Redfern, M.S., Incorporating physical demand criteria into assembly line balancing. IIE Trans., 2001, 33, 875-887.
44. Cavory, G., Dupas, R. and Goncalves, G., A genetic approach to the scheduling of preventive maintenance tasks on a single product manufacturing production line. Int. J. Prod. Econ. 2001, 74, 135-140.
45. Chan, K.C. and Tansri, H., A study of genetic crossover operations on the facilities layout problem. Computers & Ind. Eng., 1994, 26(3), 537-550.
46. Chen, C., Neppalli, R.V. and Aljaber, N., Genetic algorithms applied to the continuous flow shop problem. Computers & Ind. Eng., 1996, 30(4), 919-929.
47. Chen, C.L., Vempati, V.S. and Aljaber, N., An application of genetic algorithms for flow shop problems. Euro. J. Op. Res., 1995, 80(2), 389-397.
48. Chen, M., Roundness inspection strategies for machine visions using non-linear programs and genetic algorithms. Int. J. Prod. Res., 2000, 38(13), 2967-2988.
49. Chen, X., Wan, W. and Xu, X., Modeling rolling batch planning as vehicle routing problem with time windows. Computers & Op. Res., 1998, 25(12), 1127-1136.
50. Cheng, R. and Gen, M., Loop layout design problem in flexible manufacturing systems using genetic algorithms. Computers & Ind. Eng., 1998, 34(1), 53-61.
51. Chiou, Y.C. and Lan, L.W., Genetic clustering algorithms. Euro. J. Op. Res., 2001, 135(2), 413-427.
52. Coit, D.W. and Smith, A.E., Penalty guided genetic search for reliability design optimisation. Computers & Ind. Eng., 1996, 30(4), 895-904.
53. Cormier, D., O'Grady, P. and Sanii, E., A constraint-based genetic algorithm for concurrent engineering. Int. J. Prod. Res., 1998, 36(6), 1679-1697.
54. Crauwels, H.A.J., Potts, C.N. and Van Wassenhove, L.N., Local search heuristics for single-machine scheduling with batching to minimise the number of late jobs. Euro. J. Op. Res., 1996, 90(2), 200-214.
55. Dagli, C.H. and Sittisathanchai, S., Genetic neuro-scheduler: a new approach for job shop scheduling. Int. J. Prod. Econ., 1995, 41(1-3), 135-146.
56. De Lit, P., Latinne, P., Rekiek, B. and Delchambre, A., Assembly planning with an ordering genetic algorithm. Int. J. Prod. Res., 2001, 39(16), 3623-3640.
57. Deeter, D.L. and Smith, A.E., Economic design of reliable networks. IIE Trans., 1998, 30, 1161-1174.
58. Della Croce, F., Tadei, R. and Volta, G., A genetic algorithm for the job shop problem. Computers & Op. Res., 1995, 22(1), 15-24.
59. Dellaert, N., Jeunet, J. and Jonard, N., A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. Int. J. Prod. Econ., 2000, 68(3), 241-257.
60. Dellaert, N. and Jeunet, J., Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm. Int. J. Prod. Res., 2000, 38(5), 1083-1099.
61. Dereli, T., Filiz, I.H. and Baykasoglu, A., Optimising cutting parameters in process planning of prismatic parts by using genetic algorithms. Int. J. Prod. Res., 2001, 39(15), 3303-3328.
62. Deris, S., Omatu, S., Ohta, H., Kutar, S. and Samat, P.A., Ship maintenance scheduling by genetic algorithm and constraint-based reasoning. Euro. J. Op. Res., 1999, 112(3) 489-503.
63. Disney, S.M., Naim, M.M. and Towill, D.R., Genetic algorithm optimisation of a class of inventory control systems. Int. J. Prod. Econ., 2000, 68(3), 259-278.
64. Dorn, J., Girsch, M., Skele, G. and Slany, W., Comparison of iterative improvement techniques for schedule optimisation. Euro. J. Op. Res., 1996, 94(2), 349-362.
65. Dorndorf, U. and Pesch, E., Evolution based learning in a job shop scheduling environment. Computers & Op. Res., 1995, 22(1), 25-40.
66. Drexl, A. and Salewski, F., Distribution requirements and compactness constraints in school timetabling. Euro. J. Op. Res., 1997, 102(1), 193-215.
67. Easton, F.F. and Mansour, N., A distributed genetic algorithm for deterministic and stochastic labor scheduling problems. Euro. J. Op. Res., 1999, 118(3), 505-523.
68. Fontanili, F., Vincent, A. and Ponsonnet, R., Flow simulation and genetic algorithm as optimisation tools. Int. J. Prod. Econ., 2000, 64(1-3), 91-100.
69. Gomez, A. and de la Fuente, D., Resolution of strip-packing problems with genetic algorithms. J. Op. Res. Soc., 2000, 51(11), 1289-1295.
70. Gong, D., Yamazaki, G., Gen, M. and Xu, W., A genetic algorithm method for one-dimensional machine location problems. Int. J. Prod. Econ., 1999, 60-61, 337-343.
71. Gravel, M., Nsakanda, A.L. and Price, W., Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm. Euro. J. Op. Res., 1998, 109(2), 286-299.
72. Gravel, M., Price, W.L. and Gagne, C., Scheduling jobs in an Alcan aluminum foundry using a genetic algorithm. Int. J. Prod. Res., 2000, 38(13), 3031-3041.
73. Gupta, M.C., Gupta, Y.P. and Kumar, A., Minimising flow time variance in a single machine system using genetic algorithms. Euro. J. Op. Res., 1993, 70(3), 289-304.
74. Guvenir, H.A. and Erel, E., Multicriteria inventory classification using a genetic algorithm. Euro. J. Op. Res., 1998, 105(1), 29-38.
75. Hadj-Alouane, A.B. and Bean, J.C., A genetic algorithm for the multiple-choice integer program. Op. Res., 1997, 45(1), 92-101.
76. Hamamoto, S., Yih, Y. and Salvendy, G., Development and validation of genetic algorithm-based facility layout - a case study in the pharmaceutical industry. Int. J. Prod. Res., 1999, 37(4), 749-768.
77. Hartmann, S., A competitive genetic algorithm for resource-constrained project scheduling. Naval Res. Log., 1998, 45, 733-750.
78. He, S., Song, R. and Chaudhry, S.S., Fuzzy dispatching model and genetic algorithms for railyards operations. Euro. J. Op. Res., 2000, 124(2), 307-331.
79. Herrera, F., Lopez, E., Mendana, C. and Rodriguez, M.A., Solving an assignment-selection problem with verbal information and using genetic algorithms. Euro. J. Op. Res., 1999, 119(2), 326-337.
80. Houck, C.R., Joines, J.A. and Kay, M.G., Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Computers & Op. Res., 1996, 23(6), 587-596.
81. Hung, Y.F., Shih, C.C. and Chen, C.P., Evolutionary algorithms for production planning problems with setup decisions. J. Op. Res. Soc., 1999, 50(8), 857-866.
82. Hung, Y.F. and Chien, K.L., A multi-class multi-level capacitated lot sizing model. J. Op. Res. Soc., 2000, 51(11), 1309-1318.
83. Huntley, C.L. and Brown, D.E., A parallel heuristic for quadratic assignment problems. Computers & Op. Res., 1991, 18(3), 275-289.
84. Hwang, H. and Sun, J., A genetic-algorithm-based heuristic for the GT cell formation problem. Computers & Ind. Eng., 1996, 30(4), 941-955.
85. Hyun, C.J., Kim, Y. and Kim, Y.K., A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Computers & Op. Res., 1998, 25, 675-690.
86. Ip, W.H., Li, Y., Man, K.F. and Tang, K.S., Multi-product planning and scheduling using genetic algorithm approach. Computers & Ind. Eng., 2000, 38, 283-296.
87. Islier, A.A., A genetic algorithm approach for multiple criteria facility layout design. Int. J. Prod. Res., 1998, 36(6), 1549-1569.
88. Iwamura, K. and Liu, B., Chance constrained integer programming models for capital budgeting in fuzzy environments. J. Op. Res. Soc., 1998, 49(8), 854-861.
89. Ji, P., Sze, M.T. and Lee, W.B., A genetic algorithm of determining cycle time for printed circuit board assembly lines. Euro. J. Op. Res., 2001, 128(1), 175-184.
90. Ji, S., Li, X. and Du, R., Tolerance synthesis using second-order fuzzy comprehensive evaluation and genetic algorithm. Int. J. Prod. Res., 2000, 38(15), 3471-3483.
91. Joines, J.A., Culbreth, C.T. and King, R.E., Manufacturing cell design: an integer programming model employing genetic algorithms. IIE Trans., 1996, 28, 69-85.
92. Jordan, C., A two-phase genetic algorithm to solve variants of the batch sequencing problem. Int. J. Prod. Res., 1998, 36(3), 745-760.
93. Jozefowska, J., Mika, M., Rozycki, R., Waligora, G. and Weglarz, J., Local search metaheurisitcs for discrete-continuous scheduling problems. Euro. J. Op. Res., 1998, 107(2), 254-371.
94. Karabati, S. and Kouvelis, P., Flow-line scheduling problem with controllable processing times. IIE Trans., 1997, 29, 1-14.
95. Khan, Z., Prasad, B. and Singh, T., Machining condition optimisation by genetic algorithms and simulated annealing. Computers & Op. Res., 1997, 24(7), 647-657.
96. Khoo, L.P. and Ng, T.K., A genetic algorithm-based planning system for PCB component placement. Int. J. Prod. Econ., 1998, 54(3), 321-333.
97. Khouja, M., Michalewicz, Z. and Wilmot, M., The use of genetic algorithms to solve the economic lot size scheduling problem. Euro. J. Op. Res., 1998, 110(3), 509-525.
98. Kim, J.U. and Kim, Y.D, Simulated annealing and genetic algorithms for scheduling products with multi-level product structure. Computers & Op. Res., 1996, 23(9), 857-868.
99. Kim, Y.K., Hyun, C.J. and Kim, Y., Sequencing in mixed model assembly lines: a genetic algorithm approach. Computers & Op. Res., 1996, 23(12), 1131-1145.
100. Kim, Y.J., Kim, Y.K. and Cho, Y., A heuristic-based genetic algorithm for workload smoothing in assembly lines. Computers & Op. Res., 1998, 25(2), 99-111.
101. Kim, Y.K., Kim, Y.J. and Kim, Y., Genetic algorithms for assembly line balancing with various objectives. Computers & Ind. Eng., 1996, 30(3), 397-409.
102. Kimms, A., A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Computers & Op. Res., 1999, 26, 829-848.
103. Kochhar, J.S., Foster, B.T. and Heragu, S.S., HOPE: a genetic algorithm for the unequal area facility layout problem. Computers & Op. Res., 1998, 25, 583-594.
104. Kolonko, M., Some new results on simulated annealing applied to the job shop scheduling problem. Euro. J. Op. Res., 1999, 113(1), 123-137.
105. Koonce, D.A. and Tsai, S.C., Using data mining to find patterns in genetic algorithm solutions to a job shop schedule. Computers & Ind. Eng., 2000, 38, 361-374.
106. Kumar, N. and Shanker, K., A genetic algorithm for FMS part type selection and machine loading. Int. J. Prod. Res., 2000, 38(16), 3861-3887.
107. Kumar, S., Bagchi, T.P. and Sriskandarajah, C., Lot streaming and scheduling heuristics for m-machine no-wait Flowshops. Computers & Ind. Eng., 2000, 38(1), 149-172.
108. Kuo, R.J., A sales forecasting system based on fuzzy neural network with initial weights generated by genetic algorithm. Euro. J. Op. Res., 2001, 129, 496-517.
109. Kuroda, M., Tomita, T. and Maeda, K., Dynamic control of a cellular-line production system under variations in the product mix. Int. J. Prod. Econ., 1999, 60-61, 439-446.
110. Lam, F.S.C., Lin, B.C., Sriskandarajah, C. and Yan, H., Scheduling to minimise product design time using a genetic algorithm. Int. J. Prod. Res., 1999, 37(6), 1369-1386.
111. LeBlanc, L.J., Shtub, A. and Anandalingam, G., Formulating and solving production planning problems. Euro. J. Op. Res., 1999, 112(1), 54-81.
112. Lee, C.Y. and Choi, J.Y., A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Computers & Op. Res., 1995, 22(8), 857-869.
113. Lee, C.Y. and Kim, S.J., Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Computers & Ind. Eng., 1995, 28(2), 231-243.
114. Lee, C.Y., Piramuthu, S. and Tsai, Y.K., Job shop scheduling with a genetic algorithm and machine learning. Int. J. Prod. Res., 1997, 35(4), 1171-1191.
115. Lee, H.C. and Dagli, C.H., A parallel genetic-neuro scheduler for job-shop scheduling problems. Int. J. Prod. Econ., 1997, 51(1,2), 115-123.
116. Lee, I. and Shaw, M.J., A neural-net approach to real time flow-shop sequencing. Computers & Ind. Eng., 2000, 38, 125-147.
117. Lee, J.K. and Kim, Y.D., Search heuristics for resource constrained project scheduling. J. Op. Res. Soc., 1996, 47(5), 678-690.
118. Lee-Post, A., Part family identification using a simple genetic algorithm. Int. J. Prod. Res., 2000, 38(4), 793-810.
119. Leon, V.J., Wu S.D. and Storer, R.H., Robustness measures and robust scheduling for job shops. IIE Trans., 1994, 26(5), 32-43.
120. Leu, Y.Y., Matheson, L.A. and Rees, L.P., Assembly line balancing using genetic algorithms with heuristic-generated initial populations and multiple evaluation criteria. Decision Sci., 1994, 25(4), 581-607.
121. Leu, Y., Matheson, L.A. and Rees, L.P., Sequencing mixed-model assembly lines with genetic algorithms. Computers & Ind. Eng., 1996, 30(4), 1027-1036.
122. Levine, D., Application of a hybrid genetic algorithm to airline crew scheduling. Computers & Op. Res., 1996, 23(6), 547-558.
123. Levitin, G. and Meizin, L., Structure optimisation for continuous production systems with buffers under reliability constraints. Int. J. Prod. Econ., 2001, 70, 77-87.
124. Liaw, C.F., A hybrid genetic algorithm for the open shop scheduling problem. Euro. J. Op. Res., 2000, 124(1), 28-42.
125. Li, W., Bai, G., Zhang, C. and Wang, B., Optimisation of machining datum selection and machining tolerance allocation with genetic algorithms. Int. J. Prod. Res., 2000, 38(6), 1407-1424.
126. Li, Y., Ip, W.H. and Wang, D.W., Genetic algorithm approach to earliness and tardiness production scheduling and planning problem. Int. J. Prod. Econ., 1998, 54(1), 65-77.
127. Loh, T.S., Bukkapatnam, S.T.S., Medeiros, D. and Kwon, H., A genetic algorithm for sequential part assignment for PCB assembly. Computers & Ind. Eng., 2001, 40, 293-307.
128. Maimon, O.Z. and Braha, D., A genetic algorithm approach to scheduling PCBs on a single machine. Int. J. Prod. Res., 1998, 36(3), 761-784.
129. McMullen, P.R., Tarasewich, P. and Frazier, G.V., Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups. Int. J. Prod. Res., 2000, 38(12), 2653-2670.
130. McMullen, P.R., An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Computers & Ind. Eng., 2001, 41, 335-353.
131. Ming, X.G. and Mak, K.L., A hybrid Hopfield network-genetic algorithm approach to optimal process plan selection. Int. J. Prod. Res., 2000, 38(8), 1823-1839.
132. Monga, A., Optimal system design considering maintenance and warranty. Computers & Op. Res., 1994, 25(9), 691-705.
133. Monga, A. and Zuo, M.J., Optimal system design considering maintenance and warranty. Computers & Op. Res., 1998, 25(9), 691-705.
134. Monga, A. and Zuo, M.J., Optimal design of series-parallel systems considering maintenance and salvage value. Computers & Ind. Eng., 2001, 40, 323-337.
135. Moon, C. and Gen, M., A genetic algorithm-based approach for design of independent manufacturing cells. Int. J. Prod. Econ., 1999, 60-61, 421-427.
136. Mori, M. and Tseng, C.C., A genetic algorithm for multi-mode resource constrained project scheduling problem. Euro. J. Op. Res., 1997, 100(1), 134-142.
137. Murata, T., Ishibuchi, H. and Tanaka, H., Genetic algorithms for flowshop scheduling problems. Computers & Ind. Eng., 1996, 30(4), 1061-1071.
138. Murata, T., Ishibuchi, H. and Tanaka, H., Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers & Ind. Eng., 1996, 30(4), 957-968.
139. Nachtigall, K. and Voget, S., A genetic algorithm approach to periodic railway synchronisation. Computers & Op. Res., 1996, 23(5), 453-463.
140. Nachtigall, K. and Voget, S., Minimising waiting times in integrated fixed interval timetables by upgrading railway tracks. Euro. J. Op. Res., 1997, 103(3), 610-628.
141. Nagar, A., Heragu, S.S. and Haddock, J., A branch-and-bound approach for a two-machine flowshop scheduling problem. J. Op. Res. Soc., 1995, 46(6), 721-735.
142. Neppalli, V.R., Chen, C.L. and Gupta, J.N.D., Genetic algorithms for the two-stage bicriteria flowshop problem. Euro. J. Op. Res., 1995, 95, 356-373.
143. Nishimura, E., Imai, A. and Papadimitriou, S., Berth allocation planning in the public berth system by genetic algorithms. Euro. J. Op. Res., 2001, 35, 401-417.
144. Nordstrom, A.L. and Tufekci, S., A genetic algorithm for the talent scheduling problem. Computers & Op. Res., 1994, 21(8), 927-940.
145. Norman, B.A. and Bean, J.C., A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics, 1999, 46, 199-211.
146. Norman, B.A. and Bean, J.C., Scheduling operations on parallel machine tools. IIE Trans., 2000, 32, 449-459.
147. Novaes, A.G.N., de Cursi, J.E.S. and Graciolli, O.D., A continuous approach to the design of physical distribution systems. Computers & Op. Res., 2000, 27, 877-893.
148. Onwubolu, G.C. and Kumalo, T., Optimisation of multipass turning operations with genetic algorithms. Int. J. Prod. Res., 2001, 39(16), 3727-3745.
149. Onwubolu, G.C. and Mutingi, M., Optimising the multiple constrained resources product mix problem using genetic algorithms. Int. J. Prod. Res., 2001, 39(9), 1897-1910.
150. Onwubolu, G.C. and Mutingi, M., A genetic algorithm approach to cellular manufacturing systems. Computers & Ind. Eng., 2001, 39, 125-144.
151. Ostermark, R., Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm. Computers & Op. Res., 1999, 26, 623-635.
152. Ozdamar, L. and Barbarosoglu, G., Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem. J. Op. Res. Soc., 1999, 50(8), 810-825.
153. Ozdamar, L. and Bozyel, M.A., The capacitated lot sizing problem with overtime decisions and setup times. IIE Trans., 2000, 32, 1043-1057.
154. Pakath, R. and Zaveri, J.S., Specifying critical inputs in a genetic algorithm-driven decision support system: an automated facility. Decision Sci., 1995, 26(6), 749-780.
155. Portmann, M.C., Vignier, A., Dardilhac, D. and Dezalay, D., Branch and bound crossed with GA to solve hybrid Flowshops. Euro. J. Op. Res., 1998, 107(2), 389-401.
156. Qiao, L., Wang, X.Y. and Wang, S.C., A GA-based approach to machining operation sequencing for prismatic parts. Int. J. Prod. Res., 2000, 38(14), 3283-3303.
157. Rajasekharan, M., Peters, B.A. and Yang, T., A genetic algorithm for facility layout design in flexible manufacturing systems. Int. J. Prod. Res., 1998, 36(1), 95-110.
158. Rao, H.A., Pham, S.N. and Gu, P., A genetic algorithms-based approach for design of manufacturing systems: an industrial application. Int. J. Prod. Res., 1999, 37(3), 557-580.
159. Reeves, C.R., A genetic algorithm for flowshop sequencing. Computers & Op. Res., 1995, 22(1), 5-13.
160. Roach, A. and Nagi, R., A hybrid GA-SA algorithm for just-in-time scheduling of multi-level assemblies. Computers & Ind. Eng., 1996, 30(4), 1047-1060.
161. Rose, C. and Yates, R.D., Genetic algorithms and call admission to telecommunications networks. Computers & Op. Res., 1996, 23(5), 485-499.
162. Rossi, A. and Dini, G., Dynamic scheduling of FMS using a real-time genetic algorithm. Int. J. Prod. Res., 2000, 38(1), 1-20.
163. Rubinovitz, J. and Levitin, G., Genetic algorithm for assembly line balancing. Int. J. Prod. Econ., 1995, 41(1-3), 343-355.
164. Sakawa, M., Kato, K. and Mori, T., Flexible scheduling in a machining center through genetic algorithms. Computers & Ind. Eng., 1996, 30(4), 931-940.
165. Sakawa, M. and Kubota, R., Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithms. Euro. J. Op. Res., 2000, 120(2), 393-407.
166. Shiromaru, I., Inuiguchi, M. and Sakawa, M., A fuzzy satisficing method for electric power plant coal purchase using genetic algorithms. Euro. J. Op. Res., 2000, 126(1), 218-230.
167. Shtub, A., LeBlanc, L.J. and Cai, Z., Scheduling programs with repetitive projects: a comparison of a simulated annealing, a genetic and a pair-wise swap algorithm. Euro. J. Op. Res., 1996, 88(1), 124-139.
168. Sikora, R., A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers & Ind. Eng., 1996, 30(4), 969-981.
169. Sinclair, M., Comparison of the performance of modern heuristics for combinatorial optimisation on real data. Computers & Op. Res., 1993, 20(7), 687-695.
170. Sivrikaya-Serifoglu, F. and Ulusoy, G., Parallel machine scheduling with earliness and tardiness penalties. Computers & Op. Res., 1999, 26, 773-787.
171. Sriskandarajah, C., Jardine, A.K.S. and Chan, C.K., Maintenance scheduling of rolling stock using a genetic algorithm. J. Op. Res. Soc., 1998, 49(11), 1130-1146.
172. Stockton, D.J. and Quinn, L., Identifying economic order quantities using genetic algorithms. Int. J. Op. & Prod. Manage., 1993, 13(11), 92-103.
173. Sumichrast, R.T., Oxenrider, K.A. and Clayton, E.R., An evolutionary algorithm for sequencing production on a paced assembly line. Decision Sci., 2000, 31(1), 149-173.
174. Takeuchi, T., Yazu, Y. and Sakuma, A., Integrated environmental management process applying genetic algorithm. Int. J. Prod. Econ., 1999, 60-61, 35-43.
175. Tam, K. Y., Genetic algorithms, function optimisation, and facility layout design. Euro. J. Op. Res., 1992, 63(2), 322-347.
176. Tam, K.Y. and Chan, S.K., Solving facility layout problems with geometric constraints using parallel genetic algorithms: experimentation and findings. Int. J. Prod. Res., 1998, 36(12), 3253-3272.
177. Tang, L., Liu, J., Rong, A. and Yang, Z., A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex. Euro. J. Op. Res., 2000, 124(2), 267-282.
178. Thakur, L.S., Nair, S.K., Wen, K.W. and Tarasewich, P., A new model and solution method for product line design with pricing. J. Op. Res. Soc., 2000, 51(1), 90-101.
179. Tiwari, M.K. and Vidyarthi, N.K., Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach. Int. J. Prod. Res., 2000, 38(14), 3357-3384.
180. Ulusoy, G., Sivrikaya-Serifoglu, F. and Bilge, U., A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Computers & Op. Res., 1997, 24(4), 335-351.
181. Ulusoy, G. and Cebelli, S., An equitable approach to the payment scheduling problem in project management. Euro. J. Op. Res., 2000, 127(2), 262-278.
182. Usher, J.M. and Bowden, R.O., The application of genetic algorithms to operation sequencing for use in computer-aided process planning. Computers & Ind. Eng., 1996, 30(4), 999-1013.
183. Usher, J.S., Kamal, A.H. and Syed, W.H., Cost optimal preventive maintenance and replacement scheduling. IIE Trans., 1998, 30, 1121-1128.
184. Vahrenkamp, R., Random search in the one-dimensional cutting stock problem. Euro. J. Op. Res., 1996, 95(1), 191-201.
185. Van Buer, M.G., Woodruff, D.L. and Olson, R.T., Solving the medium newspaper production/distribution problem. Euro. J. Op. Res., 1999, 15(2), 237-254.
186. Venugopal, V. and Narendran, T.T., A genetic algorithm approach to the machine-component grouping problem with multiple objectives. Computers & Ind. Eng., 1992, 22(4), 469-480.
187. Wagner, B.J., A genetic algorithm solution for one-dimensional bundled stock cutting. Euro. J. Op. Res., 1999, 117(2), 368-382.
188. Webster, S., Jog, P.D. and Gupta, A., A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date. Int. J. Prod. Res., 1998, 36(9), 2543-2551.
189. Wolfe, W.J. and Sorensen, S.E., Three scheduling algorithms applied to the earth observing systems domain. Manage. Sci., 2000, 46(1), 148-167.
190. Wren, A. and Wren, D.O., A genetic algorithm for public transport driver scheduling. Computers & Op. Res., 1995, 22(1), 101-110.
191. Yagiura, M. and Ibaraki, T., The use of dynamic programming in genetic algorithms for permutation problems. Euro. J. Op. Res., 1996, 92(2), 387-402.
192. Yeh, E.C., A new branch-and-bound approach for the n/2/flowshop/xF+BC sub max flowshop scheduling problem. Computers & Op. Res., 1999, 26, 1293-1310.
193. Yip-Hoi, D. and Dutta, D., A genetic algorithm application for sequencing operations in process planning for parallel machining. IIE Trans., 1996, 28, 55-68.
194. Yu, H. and Liang, W., Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling. Computers & Ind. Eng., 2001, 39, 337-356.
195. Zhang, G.Q., Xue, J. and Lai, K.K., A genetic algorithm based heuristic for adjacent paper-reel layout problem. Int. J. Prod. Res., 2000, 38(14), 3343-3356.
196. Zhao, C. and Wu, Z., A genetic algorithm for manufacturing cell formation with multiple routes and multiple objectives. Int. J. Prod. Res., 2000, 38(2), 385-395.
197. Zhou, H., Feng, Y. and Han, L., The hybrid heuristic genetic algorithm for job shop scheduling. Computers & Ind. Eng., 2001, 40, 191-200.