Parallel metaheuristics for the cyclic flow shop scheduling problem

被引：15
|
作者：
Bozejko, Wojciech [1 ]
Uchronski, Mariusz [2 ]
Wodecki, Mieczyslaw [3 ]
机构：
[1] Wroclaw Univ Technol, Fac Elect, Dept Control Syst & Mechatron, Janiszewskiego 11-17, PL-50372 Wroclaw, Poland
[2] Wroclaw Ctr Networking & Supercomp, Wyb Wyspianskiego 27, PL-50370 Wroclaw, Poland
[3] Univ Wroclaw, Inst Comp Sci, Joliot Curie 15, PL-50383 Wroclaw, Poland
来源：
COMPUTERS & INDUSTRIAL ENGINEERING | 2016年 / 95卷
关键词：
Scheduling; Parallel algorithm; Cyclic flow shop problem; Block properties; ALGORITHM; MAKESPAN; TIMES;
D O I：
10.1016/j.cie.2016.03.008
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In the paper there was proposed a new method of detection of block properties for cyclic flow shop problem with machine setups that uses patterns designated for each machine by solving the adequate traveling salesman problem. The proposed method is intended to be run in the environment of shared memory in concurrent computations, such as coprocessors, GPU, or machines with multi-core CPUs. The proposed method of accelerating the review of the neighborhood through the use of the blocks was tested on two parallel metaheuristics: tabu search and simulated annealing. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码：156 / 163
页数：8
相关论文
共 50 条
  • [1] Solving the continuous flow-shop scheduling problem by metaheuristics
    Fink, A
    Voss, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 151 (02) : 400 - 414
  • [2] Metaheuristics for the flow shop scheduling problem with maintenance activities integrated
    Branda, Antonella
    Castellano, Davide
    Guizzi, Guido
    Popolo, Valentina
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 151
  • [3] Metaheuristics for the mixed shop scheduling problem
    Liu, SQ
    Ong, HL
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2004, 21 (01) : 97 - 115
  • [4] A hybridisation of metaheuristics for flow shop scheduling
    A. Noorul Haq
    D. Ravindran
    V. Aruna
    S. Nithiya
    [J]. The International Journal of Advanced Manufacturing Technology, 2004, 24 : 376 - 380
  • [5] A hybridisation of metaheuristics for flow shop scheduling
    Haq, AN
    Ravindran, D
    Aruna, V
    Nithiya, S
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2004, 24 (5-6): : 376 - 380
  • [6] A hybridisation of metaheuristics for flow shop scheduling
    [J]. Haq, A.N. (anhaq@nitt.edu), 1600, Springer-Verlag London Ltd (24): : 5 - 6
  • [7] Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated
    Branda, Antonella
    Castellano, Davide
    Guizzi, Guido
    Popolo, Valentina
    [J]. DATA IN BRIEF, 2021, 36
  • [8] Metaheuristics for the online printing shop scheduling problem
    Lunardi, Willian T.
    Birgin, Ernesto G.
    Ronconi, Debora P.
    Voos, Holger
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 293 (02) : 419 - 441
  • [9] Parallel tabu search for the cyclic job shop scheduling problem
    Bozejko, Wojciech
    Gnatowski, Andrzej
    Pempera, Jaroslaw
    Wodecki, Mieczyslaw
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 512 - 524
  • [10] Parallel genetic algorithm for the flow shop scheduling problem
    Bozejko, W
    Wodecki, M
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2004, 3019 : 566 - 571
12345