Parallel patterns determination in solving cyclic flow shop problem with setups

Publication Type:
Journal Article
Archives of Control Sciences, 2017, 27 (2), pp. 183 - 195
Issue Date:
Full metadata record
© 2017 Archives of Control Sciences 2017. 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.
Please use this identifier to cite or link to this item: