Parallel patterns determination in solving cyclic flow shop problem with setups

The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel X...

Full description

Saved in:
Bibliographic Details
Published inArchives of control sciences Vol. 27; no. 2; pp. 183 - 195
Main Authors Bożejko, Wojciech, Chaczko, Zenon, Uchroński, Mariusz, Wodecki, Mieczysław
Format Journal Article
LanguageEnglish
Published Warsaw De Gruyter Open 01.06.2017
De Gruyter Poland
Polish Academy of Sciences
Subjects
cyclic scheduling
metaheuristics
parallel algorithm
Parallel processing (computers)
Production scheduling
Setup times
Traveling salesman problem
Online AccessGet full text

Cover

More Information
Summary:The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2300-2611
1230-2384
2300-2611
DOI:10.1515/acsc-2017-0011