2017
DOI: 10.1016/j.cie.2017.09.042
|View full text |Cite
|
Sign up to set email alerts
|

Parallel tabu search for the cyclic job shop scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 57 publications
(15 citation statements)
references
References 22 publications
0
13
0
Order By: Relevance
“…Pursuant to GOST R 57054-2016, no operational limit state is determined for linings, and its failure criterion is partial or complete rupture of the liner [9]. However, in the course of storage, transportation or installation, operation, further dismantling and repeated transportation or storage lining elements may develop cold cracks, micro cracks or subcritically grown cracks [10][11][12][13][14][15].…”
Section: Resultsmentioning
confidence: 99%
“…Pursuant to GOST R 57054-2016, no operational limit state is determined for linings, and its failure criterion is partial or complete rupture of the liner [9]. However, in the course of storage, transportation or installation, operation, further dismantling and repeated transportation or storage lining elements may develop cold cracks, micro cracks or subcritically grown cracks [10][11][12][13][14][15].…”
Section: Resultsmentioning
confidence: 99%
“…Pylon strain gauges were installed before the mounting of cheek boards in the place where they are jointed with the base plate. Before being cased each device was fixed with wires to the reinforcement in an intended orientation [8][9][10][11][12][13][14][15].…”
Section: Methodsmentioning
confidence: 99%
“…Unfortunately, the method requires a very large number of processors, even for small problem sizes. Finally, in paper [48], parallel computing was used to solve the cyclic job shop scheduling problem (JSSP) with the goal of minimizing the cycle time. With the use of the Intel Xeon Phi manycore coprocessor, the authors achieved a speedup of up to 35 times that of the sequential algorithm.…”
Section: Parallel Computingmentioning
confidence: 99%