Improved genetic algorithm for job shop scheduling
In order to obtain the optimal solution of genetic algorithm for job shop scheduling problem and improve the iteration speed of the algorithm, the improved method of genetic algorithm is studied. The scheduling model is established with the shortest processing time of the workpiece as the target. An...
Main Authors: | Xianpeng ZHENG, Lei WANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Hebei University of Science and Technology
2019-12-01
|
Series: | Journal of Hebei University of Science and Technology |
Subjects: | |
Online Access: | http://xuebao.hebust.edu.cn/hbkjdx/ch/reader/create_pdf.aspx?file_no=b201906006&flag=1&journal_ |
Similar Items
-
ADAPTIVE, MULTI-OBJECTIVE JOB SHOP SCHEDULING USING GENETIC ALGORITHMS
by: Metta, Haritha
Published: (2008) -
OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS
by: Al-Hinai, Nasr
Published: (2011) -
OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS
by: Al-Hinai, Nasr
Published: (2011) -
An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems
by: Chandramouli Anandaraman
Published: (2011-10-01) -
Dual Resource Constrained Flexible Job Shop Scheduling Based on Improved Quantum Genetic Algorithm
by: Shoujing Zhang, et al.
Published: (2021-05-01)