Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem

被引：0
|
作者：
Bozejko, Wojciech [1 ]
Uchronski, Mariusz [1 ]
Wodecki, Mieczyslaw [1 ]
机构：
[1] Wroclaw Univ Technol, Inst Comp Engn Control & Robot, PL-50372 Wroclaw, Poland
来源：
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II | 2013年 / 7895卷
关键词：
GENETIC ALGORITHM; TARDINESS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We propose two parallel algorithms based on neuro-tabu search method, designed to solve the jobs shop problem of scheduling. The fist algorithm is based on independent runs of the neuro-tabu with different starting points. The second one uses sophisticated diversification method based on path-relinking methodology applied to the set of elite solutions. Proposed approaches are especially effective for the instances of large size.
引用
收藏
页码：489 / 499
页数：11
相关论文
共 50 条
  • [31] A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    Jun-Qing Li
    Quan-Ke Pan
    P. N. Suganthan
    T. J. Chua
    The International Journal of Advanced Manufacturing Technology, 2011, 52 : 683 - 697
  • [32] A fast tabu search algorithm for the group shop scheduling problem
    Liu, SQ
    Ong, HL
    Ng, KM
    ADVANCES IN ENGINEERING SOFTWARE, 2005, 36 (08) : 533 - 539
  • [33] A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    Li, Jun-Qing
    Pan, Quan-Ke
    Suganthan, P. N.
    Chua, T. J.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 52 (5-8): : 683 - 697
  • [34] TABU SEARCH FOR THE JOB-SHOP SCHEDULING PROBLEM WITH MULTIPURPOSE MACHINES
    HURINK, J
    JURISCH, B
    THOLE, M
    OR SPEKTRUM, 1994, 15 (04) : 205 - 215
  • [35] Job shop scheduling by simulated annealing algorithm combined with tabu search
    Han, Limin
    Huang, Hongxuan
    Feng, Yuncheng
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 1998, 24 (01): : 75 - 78
  • [36] Parallel tabu search algorithm for the hybrid flow shop problem
    Bozejko, Wojciech
    Pempera, Jaroslaw
    Smutnicki, Czeslaw
    COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (03) : 466 - 474
  • [37] A Parallel Genetic Algorithm for the Job Shop Scheduling Problem
    Nguyen Huu Mui
    Vu Dinh Hoa
    Luc Tri Tuyen
    2012 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY (ISSPIT), 2012, : 19 - 24
  • [38] A guided tabu search/path relinking algorithm for the job shop problem
    Nasiri, Mohammad Mahdi
    Kianfar, Farhad
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 58 (9-12): : 1105 - 1113
  • [39] A guided tabu search/path relinking algorithm for the job shop problem
    Mohammad Mahdi Nasiri
    Farhad Kianfar
    The International Journal of Advanced Manufacturing Technology, 2012, 58 : 1105 - 1113
  • [40] An Effective Hybrid Imperialist Competitive Algorithm and Tabu Search for an Extended Flexible Job Shop Scheduling Problem
    Lunardi, Willian Tessaro
    Voos, Holger
    Cherri, Luiz Henrique
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 204 - 211
12345