A genetic algorithm-based approach to machine assignment problem

International Journal of Production Research

Volumn 43, Issue 12, 2005, Pages 2451-2472

  Chan, F T S ^a   Wong, T C ^a   Chan, L Y ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Genetic algorithms; Job shop scheduling; Machine assignment; Machining flexibility

Indexed keywords

CONTROL SYSTEM ANALYSIS; COSTS; CUSTOMER SATISFACTION; MACHINING; PROBLEM SOLVING; SCHEDULING;

JOB-SHOP SCEDULING; MACHINE ASSIGNMENT; MACHINING FLEXIBILITY; PRODUCTION SCHEDULING;

GENETIC ALGORITHMS;

EID: 27744463120     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500045956     Document Type: Article

References (26)

1. Adams, J., Balas, E. and Zawack, D., The shifting bottleneck procedure for job-shop scheduling. Man. Sci., 1988, 34(3), 391-401.
2. Beach, R., Muhlemann, A.P., Price, D.H.R., Paterson, A. and Sharp, J.A., Theory and methodology: A review of manufacturing flexibility. Euro. J. Op. Res., 2000, 122, 41-57.
3. Chandra, P. and Tombak, M.M., Models for the evaluation of routing and machine flexibility. Euro. J. Op. Res., 1992, 60, 156-165.
4. Cheng, R., Gen, M. and Tsujimura, Y., A tutorial survey of job-shop scheduling problems using genetic algorithms. Part II: Hybrid genetic search strategies. Comp. & Indust. Eng., 1999, 36, 343-364.
5. Croce, F.D., Tadei, R. and Volta, G., A genetic algorithm for the job-shop problem. Comp. & Op. Res., 1995, 22(1), 15-24.
6. Dorndorf, U. and Pesch, E., Evolution based learning in a job-shop scheduling environment. Comp. & Op. Res., 1995, 22(1), 25-40.
7. Efstathiou, J. and Golby, P., Application of a simple method of cell design accounting for product demand and operation sequence. Integ. Manuf. Syst., 2001, 12 (4), 246-257.
8. Fisher, H. and Thompson, G.L., Probabilistic learning combinations of local job-shop scheduling rules. In Industrial Scheduling, edited by J. F. Muth, and G. L. Thompson, 1963 (Prentice Hall: Englewood Cliffs, NJ).
9. Kim, Y.D. and Yano, C.A., Impact of throughput-based objectives and machine grouping decisions on the short-term performance of flexible manufacturing systems. Int. J. Prod. Res., 1997, 35(12), 3303-3322.
10. Knosala, R. and Wal, T., A production scheduling problem using genetic algorithm. J. Mat. Proc. Tech., 2001, 109, 90-95.
11. Kobayashi, S., Ono, I. and Yamamura, M., An efficient genetic algorithm for job-shop scheduling problems, in Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, Pennsylvania, 1995, pp. 506-511.
12. Kochikar, V.P. and Narendran, T.T., Logical cell formation in FMS, using flexibility-based criteria. Int. J. Flex. Manuf. Syst., 1998, 10, 163-182.
13. Lawrence, S., Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, GSIA, 1984 (Carnegie Mellon University: Pittsburgh, Pennsylvania).
14. Lozano, S., Canca, D., Guerrero, F. and Garcia, J.M., Machine grouping using sequence-based similarity coefficients and neural networks. Robotics & Comp. Integ. Manuf., 2001, 17, 399-404.
15. Mohamed, Z.M., Youssef, M.A. and Huq, F., 2001, The impact of machine flexibility on the performance of flexible manufacturing systems. Int. J. Op. & Prod. Manage., 21(5/6), 707-727.
16. Moon, C. and Gen, M., A genetic algorithm-based approach for design of independent manufacturing cells. Int. J. Prod. Econ., 1999, 60-61, 421-426.
17. Moon, C., Lee, M., Seo, Y. and Lee, Y.H., Integrated machine tool selection and operation sequencing with capacity and precedence constraints using genetic algorithm. Com. & Indust. Eng., 2002, 43, 605-621.
18. Nagi, R., Harhalakis, G. and Proth, J.M., Multiple routings and capacity consideration in group technology applications. Int. J. Prod. Res., 1990, 28(12), 2243-2257.
19. Nair, J.G. and Narendran, T.T., CASE: A clustering algorithm for cell formation with sequence data. Int. J. Prod. Res., 1998, 36(1), 157-179.
20. Ohta, H. and Nakamura, M., Cell formation with reduction in setup times. Comp. & Indust. Eng., 2002, 42, 317-327.
21. Ono, I., Yamamura, M. and Kobayashi, S., A genetic algorithm for job-shop scheduling problems using job-based order crossover, in Proceedings of International Conference on Evolutionary Computation, Nayoya University, Japan, 1996, pp. 547-552.
22. Pflughoeft, K. and Hutchinson, G.K., The effects of workstation flexibility on the (NxN) jobshop problem. Int. J. Flex. Manuf. Syst., 1999, 11, 103-113.
23. Uddin, M.K. and Shanker, K., Grouping of parts and machines in presence of alternative process routes by genetic algorithm. Int. J. Prod. Econ., 2002, 76, 219-228.
24. Yoon, S.-H. and Ventura, J.A., An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Trans., 2002, 34, 779-787.
25. Zhang, Q., Vonderembse, M.A. and Lim, J.S., Manufacturing flexibility: defining and analyzing relationships among competence, capability and customer satisfaction. J. Op. Manage., 2003, 21, 173-191.
26. Zhou, H., Feng, Y. and Han, L., The hybrid heuristic genetic algorithm for job-shop scheduling. Comp. & Indust. Eng., 2001, 40, 191-200.