Solution Space Analysis and Feasible Genetic Algorithm for Assembly Job-shop Scheduling Problems

被引：2
|
作者：
Zhao, G. K. [1 ]
Wang, F. J. [1 ]
Liu, W. [1 ]
Lu, X. H. [1 ]
机构：
[1] Dalian Univ Technol, Minist Educ, Key Lab Precis & Nontradit Machining Technol, Dalian, Peoples R China
来源：
ADVANCES IN MATERIALS MANUFACTURING SCIENCE AND TECHNOLOGY XIII, VOL 1: ADVANCED MANUFACTURING TECHNOLOGY AND EQUIPMENT, AND MANUFACTURING SYSTEMS AND AUTOMATION | 2009年 / 626-627卷
关键词：
Assembly Job-shop Scheduling Problem; Feasible solution space; Fix operator; Feasible Genetic algorithm;
D O I：
10.4028/www.scientific.net/MSF.626-627.705
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
The classical job-shop scheduling problems (JSP) become assembly job-shop scheduling problems (AJSP) if assembly constraints are attached to them. The entire solution space size and the feasible one of AJSP are analyzed and obtained by utilizing combinational mathematics It is proved that the feasible solution space takes extremely small portion of the entire one To minimize the makespan of AJSP, genetic algorithm searching in feasible solution space (FGA) is proposed and designed, and the search range of FGA is limited to feasible solution space. Finally, benchmarks tests and results are given which demonstrate the advantage and efficiency of FGA
引用
收藏
页码：705 / 710
页数：6
相关论文
共 50 条
  • [41] Genetic algorithm for solving job-shop scheduling problem
    Tsinghua Univ, Beijing, China
    [J]. Jiguang Zazhi, 4 (1-5):
  • [42] A Grafted Genetic Algorithm for the Job-Shop Scheduling Problem
    LI Xiang-jun 1
    [J]. International Journal of Plant Engineering and Management, 2004, (02) : 91 - 96
  • [43] Improved genetic algorithm for the job-shop scheduling problem
    Liu, Tung-Kuan
    Tsai, Jinn-Tsong
    Chou, Jyh-Horng
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 27 (9-10): : 1021 - 1029
  • [44] Genetic Algorithm for Solving Job-Shop Scheduling Problem
    Li XiaoBo
    [J]. 2011 INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND NEURAL COMPUTING (FSNC 2011), VOL IV, 2011, : 296 - 298
  • [45] Flexible Job-Shop Scheduling Problem by Genetic Algorithm
    Ida, Kenichi
    Oka, Kensaku
    [J]. ELECTRICAL ENGINEERING IN JAPAN, 2011, 177 (03) : 28 - 35
  • [46] A Hybrid Genetic Algorithm for Job-Shop Scheduling Problem
    Wang Lihong
    Ten Haikun
    Yu Guanghua
    [J]. 2015 IEEE 28TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2015, : 271 - 274
  • [47] An Improved Genetic Algorithm for the Job-Shop Scheduling Problem
    Hong, Hui
    Li, Tianying
    Wang, Hongtao
    [J]. DCABES 2008 PROCEEDINGS, VOLS I AND II, 2008, : 621 - +
  • [48] Improved genetic algorithm for the job-shop scheduling problem
    Liu, TK
    Tsai, JT
    Chou, JH
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 27 (9-10): : 1021 - 1029
  • [49] A genetic algorithm for job-shop scheduling problems using job-based order crossover
    Ono, I
    Yamamura, M
    Kobayashi, S
    [J]. 1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, : 547 - 552
  • [50] Active solution space and search on job-shop scheduling problem
    Watanabe, Masato
    Ida, Kenichi
    Gen, Mitsuo
    [J]. Electrical Engineering in Japan (English translation of Denki Gakkai Ronbunshi), 2006, 154 (04): : 61 - 67
12345