GENETIC ALGORITHMS FOR SOLVING SCHEDULING PROBLEMS IN MANUFACTURING SYSTEMS

被引:5
作者
Lawrynowicz, Anna [1 ]
机构
[1] Warsaw Univ Technol, Fac Management, Warsaw, Poland
关键词
manufacturing system; scheduling; genetic algorithm; genetic algorithms for the advanced;
D O I
10.2478/v10238-012-0039-2
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Scheduling manufacturing operations is a complicated decision making process. From the computational point of view, the scheduling problem is one of the most notoriously intractable NP-hard optimization problems. When the manufacturing system is not too large, the traditional methods for solving scheduling problem proposed in the literature are able to obtain the optimal solution within reasonable time. But its implementation would not be easy with conventional information systems. Therefore, many researchers have proposed methods with genetic algorithms to support scheduling in the manufacturing system. The genetic algorithm belongs to the category of artificial intelligence. It is a very effective algorithm to search for optimal or near-optimal solutions for an optimization problem. This paper contains a survey of recent developments in building genetic algorithms for the advanced scheduling. In addition, the author proposes a new approach to the distributed scheduling in industrial clusters which uses a modified genetic algorithm.
引用
收藏
页码:7 / 26
页数:20
相关论文
共 64 条
[1]   A survey of scheduling problems with setup times or costs [J].
Allahverdi, Ali ;
Ng, C. T. ;
Cheng, T. C. E. ;
Kovalyov, Mikhail Y. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :985-1032
[2]   Genetic local search for multi-objective flowshop scheduling problems [J].
Arroyo, JEC ;
Armentano, VA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 167 (03) :717-738
[3]   Non-identical parallel machine scheduling using genetic algorithm [J].
Balin, Savas .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (06) :6814-6821
[4]   A real-coded genetic algorithm for training recurrent neural networks [J].
Blanco, A ;
Delgado, M ;
Pegalajar, MC .
NEURAL NETWORKS, 2001, 14 (01) :93-105
[5]   A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness [J].
Braglia, Marcello ;
Grassi, Andrea .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2009, 47 (01) :273-288
[6]   An introduction of dominant genes in genetic algorithm for FMS [J].
Chan, F. T. S. ;
Chung, S. H. ;
Chan, L. Y. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (16) :4369-4389
[7]   An adaptive genetic algorithm with dominated genes for distributed scheduling problems [J].
Chan, FTS ;
Chung, SH ;
Chan, PLY .
EXPERT SYSTEMS WITH APPLICATIONS, 2005, 29 (02) :364-371
[8]   Two-phase sub population genetic algorithm for parallel machine-scheduling problem [J].
Chang, PC ;
Chen, SH ;
Lin, KL .
EXPERT SYSTEMS WITH APPLICATIONS, 2005, 29 (03) :705-712
[9]   Nonlinear system identification and control using a real-coded genetic algorithm [J].
Chang, Wei-Der .
APPLIED MATHEMATICAL MODELLING, 2007, 31 (03) :541-550
[10]   A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem [J].
Chen, Jen-Shiang ;
Pan, Jason Chao-Hsien ;
Lin, Chien-Min .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (01) :570-577