Parallel patterns determination in solving cyclic flow shop problem with setups

Bozejko, W; Chaczko, Z; Uchroński, M; Wodecki, M

Parallel patterns determination in solving cyclic flow shop problem with setups

Bozejko, W Chaczko, Z

Uchroński, M Wodecki, M

Permalink

Publication Type:: Journal Article
Citation:: Archives of Control Sciences, 2017, 27 (2), pp. 183 - 195
Issue Date:: 2017-06-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted Manuscript VersionAdobe PDF (577.83 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Bozejko, W	en_US
dc.contributor.author	Chaczko, Z https://orcid.org/0000-0002-2816-7510	en_US
dc.contributor.author	Uchroński, M	en_US
dc.contributor.author	Wodecki, M	en_US
dc.date.issued	2017-06-01	en_US
dc.identifier.citation	Archives of Control Sciences, 2017, 27 (2), pp. 183 - 195	en_US
dc.identifier.issn	1230-2384	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115406
dc.description.abstract	© 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.	en_US
dc.relation.ispartof	Archives of Control Sciences	en_US
dc.relation.isbasedon	10.1515/acsc-2017-0011	en_US
dc.title	Parallel patterns determination in solving cyclic flow shop problem with setups	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	27	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
pubs.organisational-group	/University of Technology Sydney/Strength - INEXT - Innovation in IT Services and Applications
utslib.copyright.status	open_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	27	en_US

Abstract:

© 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:

http://hdl.handle.net/10453/115406