EM algorithm for job-shop scheduling problem

被引:0
|
作者
机构
[1] Jiang, Jianguo
[2] Li, Ting
[3] Yu, Ting
来源
Jiang, Jianguo | 1600年 / Binary Information Press卷 / 11期
关键词
Job shop scheduling;
D O I
10.12733/jics20104060
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [1] Hybird algorithm for job-shop scheduling problem
    Chen, X
    Kong, QS
    Wu, QD
    PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1739 - 1743
  • [2] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [3] An improved genetic algorithm for Job-shop scheduling problem
    Lou Xiao-fang
    Zou Feng-xing
    Gao Zheng
    Zeng Ling-li
    Ou Wei
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 2595 - +
  • [4] A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
    Wang, Jin Feng
    Du, Bi Qiang
    Ding, Hai Min
    ADVANCED RESEARCH ON COMPUTER SCIENCE AND INFORMATION ENGINEERING, PT I, 2011, 152 : 332 - 339
  • [5] A novel algorithm for solving job-shop scheduling problem
    Muthiah, A.
    Rajkumar, R.
    MECHANIKA, 2017, 23 (04): : 610 - 616
  • [6] Genetic algorithm for the flexible job-shop scheduling problem
    Kacem, I
    2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS, 2003, : 3464 - 3469
  • [7] A Hybrid Algorithm for Flexible Job-shop Scheduling Problem
    Tang, Jianchao
    Zhang, Guoji
    Lin, Binbin
    Zhang, Bixi
    CEIS 2011, 2011, 15
  • [8] Genetic algorithm for solving job-shop scheduling problem
    Tsinghua Univ, Beijing, China
    Jiguang Zazhi, 4 (1-5):
  • [9] Improved genetic algorithm for the job-shop scheduling problem
    Tung-Kuan Liu
    Jinn-Tsong Tsai
    Jyh-Horng Chou
    The International Journal of Advanced Manufacturing Technology, 2006, 27 : 1021 - 1029
  • [10] A genetic algorithm for the Flexible Job-shop Scheduling Problem
    Pezzella, F.
    Morganti, G.
    Ciaschetti, G.
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (10) : 3202 - 3212