An efficient makespan prediction for the job-shop problem solving

被引：0
|
作者：
Murovec, Boštjan [1 ]
机构：
[1] Univerza Ljubljani, Fakulteta za Elektrotehniko, Trzaška 25, 1000 Ljubljana, Slovenia
来源：
Elektrotehniski Vestnik/Electrotechnical Review | 2002年 / 69卷 / 3-4期
关键词：
Approximation theory - Combinatorial mathematics - Heuristic methods - Iterative methods - Optimization - Perturbation techniques - Problem solving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A new makespan estimation procedure is proposed. It is generally less accurate but faster to calculate than the one of Dell'Amico. It is shown that knowing the exact makespan of moves is not only unnecessary for their successful selection, but it can even lead to selection of wrong moves. Empirical tests show that the approach decreases execution time with no significant degradation or often even with a slight improvement of the optmimization results.
引用
收藏
页码：234 / 239
相关论文
共 50 条
  • [41] Solving the integrated lot-sizing and job-shop scheduling problem
    Urrutia, Edwin David Gomez
    Aggoune, Riad
    Dauzere-Peres, Stephane
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (17) : 5236 - 5254
  • [42] A new hybrid heuristic technique for solving job-shop scheduling problem
    Tsai, CF
    Lin, FC
    IDAACS'2003: PROCEEDINGS OF THE SECOND IEEE INTERNATIONAL WORKSHOP ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS, 2003, : 53 - 58
  • [43] Solving the Job-Shop Scheduling Problem Based on Cellular Genetic Algorithm
    Wen Mingyue
    Zhang Yi
    Hu Fangjun
    Liu Zheng
    ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING II, PTS 1-3, 2013, 433-435 : 639 - 644
  • [44] Solving Fuzzy Job-Shop Scheduling Problem by a Hybrid PSO Algorithm
    Li, Junqing
    Pan, Quan-Ke
    Suganthan, P. N.
    Tasgetiren, M. Fatih
    SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7269 : 275 - 282
  • [45] A novel initialization method for solving flexible job-shop scheduling problem
    Shi Yang
    Zhang Guohui
    Gao Liang
    Yuan Kun
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 68 - +
  • [46] Survey on genetic algorithms for solving flexible job-shop scheduling problem
    Huang X.
    Chen S.
    Zhou T.
    Sun Y.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (02): : 536 - 551
  • [47] An Efficient Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Moghadam, Ali Mokhtari
    Wong, Kuan Yew
    Piroozfard, Hamed
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 1409 - 1413
  • [48] Simulated annealing approach for minimizing the makespan of the general job-shop
    Satake, T
    Morikawa, K
    Takahashi, K
    Nakamura, N
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1999, 60-1 : 515 - 522
  • [49] Genetic algorithm approach for minimizing the makespan of the general job-shop
    Satake, T
    Morikawa, K
    Takahashi, K
    Nakamura, N
    ISIM'2000: PROCEEDINGS OF THE FIFTH CHINA-JAPAN INTERNATIONAL SYMPOSIUM ON INDUSTRIAL MANAGEMENT, 2000, : 155 - 160
  • [50] A GENETIC ALGORITHM FOR THE JOB-SHOP PROBLEM
    DELLACROCE, F
    TADEI, R
    VOLTA, G
    COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (01) : 15 - 24
12345