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
来源
关键词
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 条
  • [31] Minimizing the makespan for the MPM job-shop with availability constraints
    Zribi, N.
    El Kamel, A.
    Borne, P.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (01) : 151 - 160
  • [32] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [33] New scheduling type applied to solving job-shop scheduling problem
    Zhang, Chaoyong
    Guan, Zailin
    Liu, Qiong
    Shao, Xinyu
    Li, Peigen
    Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering, 2008, 44 (10): : 24 - 31
  • [34] Research on Improved Genetic Algorithm Solving Flexible Job-Shop Problem
    Li, Minshuo
    MinghaiYao
    ADVANCED MECHANICAL DESIGN, PTS 1-3, 2012, 479-481 : 1918 - 1921
  • [35] Research on immune genetic algorithm for solving the job-shop scheduling problem
    Xiao-dong Xu
    Cong-xin Li
    The International Journal of Advanced Manufacturing Technology, 2007, 34 : 783 - 789
  • [36] Research on immune genetic algorithm for solving the job-shop scheduling problem
    Xu, Xiao-Dong
    Li, Cong-Xin
    International Journal of Advanced Manufacturing Technology, 2007, 34 (7-8): : 783 - 789
  • [37] A new neighborhood structure for solving the flexible job-shop scheduling problem
    Huang X.
    Chen S.
    Zhou T.
    Sun Y.
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2021, 41 (09): : 2367 - 2378
  • [38] Research on immune genetic algorithm for solving the job-shop scheduling problem
    Xu, Xiao-Dong
    Li, Cong-Xin
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 34 (7-8): : 783 - 789
  • [39] An efficient combination of dispatch rules for Job-Shop Scheduling Problem
    Kawai, T
    Fujimoto, Y
    2005 3RD IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN), 2005, : 484 - 488
  • [40] Hybrid Intelligent Algorithm Solving Uncertainty Job-Shop Scheduling Problem
    Hu, Yang-Jun
    Song, Cun-li
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON ADVANCES IN MECHANICAL ENGINEERING AND INDUSTRIAL INFORMATICS (AMEII 2016), 2016, 73 : 528 - 534