Search results

Filters

  • Journals

Search results

Number of results: 3
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Abstract 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.
Go to article

Authors and Affiliations

Wojciech Bożejko
Zenon Chaczko
Mariusz Uchroński
Mieczysław Wodecki

This page uses 'cookies'. Learn more