Parallel Simulated Annealing Algorithm for Cyclic Flexible Job Shop Scheduling Problem

被引：12
|
作者：
Bozejko, Wojciech [1 ]
Pempera, Jaroslaw [1 ]
Wodecki, Mieczyslaw [2 ]
机构：
[1] Wroclaw Univ Technol, Fac Elect, Dept Automat Mechatron & Control Syst, PL-50370 Wroclaw, Poland
[2] Univ Wroclaw, Inst Comp Sci, PL-50383 Wroclaw, Poland
来源：
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II (ICAISC 2015) | 2015年 / 9120卷
关键词：
TABU SEARCH; OPTIMIZATION;
D O I：
10.1007/978-3-319-19369-4_53
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper deals with scheduling of tasks in cyclic flexible job shop scheduling problem (CFJSSP). We have proposed a new method of computing cyclic time for CFJSSP. This method is based on the known properties of the job shop problem as well as new properties of cyclic scheduling. We have developed two versions of proposed method: sequential and parallel. The parallel version is dedicated to the computing devices supporting vector processing. Finally, we have developed double paralyzed simulated annealing algorithms: fine grained - vector processing, multiple walk - multi core processing. Computation results, provided on market multicore processors, are presented for a set of benchmark instances from the literature.(1)
引用
收藏
页码：603 / 612
页数：10
相关论文
共 50 条
  • [1] Parallel Simulated Annealing for the Job Shop Scheduling Problem
    Bozejko, Wojciech
    Pempera, Jaroslaw
    Smutnicki, Czeslaw
    [J]. COMPUTATIONAL SCIENCE - ICCS 2009, PART I, 2009, 5544 : 631 - 640
  • [2] Accelerated simulated annealing algorithm applied to the flexible job shop scheduling problem
    Antonio Cruz-Chavez, Marco
    Martinez-Rangel, Martin G.
    Cruz-Rosales, Martin H.
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (05) : 1119 - 1137
  • [3] The Improved Simulated Annealing Genetic Algorithm for Flexible Job-Shop Scheduling Problem
    Gu, Xiaolin
    Huang, Ming
    Liang, Xu
    [J]. PROCEEDINGS OF 2017 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2017), 2017, : 22 - 27
  • [4] Immune simulated annealing algorithm for the job shop scheduling problem
    Zhang, Rui
    Wu, Cheng
    [J]. Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2008, 19 (23): : 2824 - 2829
  • [5] Improved Simulated annealing Algorithm for Flexible job shop scheduling Problems
    Gao Chenyang
    Gao Yuelin
    Lv Shanshan
    [J]. PROCEEDINGS OF THE 28TH CHINESE CONTROL AND DECISION CONFERENCE (2016 CCDC), 2016, : 2191 - 2196
  • [6] A simulated annealing algorithm for job shop scheduling
    Ponnambalam, SG
    Jawahar, N
    Aravindan, P
    [J]. PRODUCTION PLANNING & CONTROL, 1999, 10 (08) : 767 - 777
  • [7] A hybrid immune simulated annealing algorithm for the job shop scheduling problem
    Zhang, Rui
    Wu, Cheng
    [J]. APPLIED SOFT COMPUTING, 2010, 10 (01) : 79 - 89
  • [8] Genetic Algorithm with Simulated Annealing for Resolving Job Shop Scheduling Problem
    Liang, Xu
    Du, Zhen
    [J]. 2020 IEEE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), 2020, : 64 - 68
  • [9] Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling
    N. Shivasankaran
    P. Senthil Kumar
    K. Venkatesh Raja
    [J]. International Journal of Computational Intelligence Systems, 2015, 8 : 455 - 466
  • [10] Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling
    Shivasankaran, N.
    Kumar, P. Senthil
    Raja, K. Venkatesh
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2015, 8 (03) : 455 - 466
12345