SCHEDULING COMPLEX MANUFACTURING SYSTEMS USING A GENETIC ALGORITHM
This paper presents a Genetic Algorithm (GA) application for solving scheduling problems in complex manufacturing systems. Complex real systems combine features of both project and flexible manufacturing systems and include alternative processing routes, parallel execution of manufacturing operations, multiple options for machine selection, and job recirculation, among others. The proposed chromosome representation uses a combination of integer and random keys. The integer section is used for resource selection and the random keys are used as priorities by the schedule procedure to generate feasible schedules. The performance of the GA was tested using both problems from the literature and from a real case study. Two objective functions are chosen for testing: Makespan and Mean Flow Time. Computational results show the effectiveness of the proposed algorithm.
Scheduling Genetic Algorithms Flezible Job Shop Alternative routes
E. Gutiérrez G. Mejía
Departamento de Ingeniería Industrial, Universidad de los Andes, Carrera 1E No 19A-40, Bogotá D.C.,C Departamento de Ingeniería Industrial, Universidad de los Andes, Carrera 1E No 19A-40, Bogotá D.C.,
国际会议
上海
英文
1-6
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）