Abstract
In the paper there was proposed a new method of detection of block properties for cyclic flow shop problem with machine setups that uses patterns designated for each machine by solving the adequate traveling salesman problem. The proposed method is intended to be run in the environment of shared memory in concurrent computations, such as coprocessors, GPU, or machines with multi-core CPUs. The proposed method of accelerating the review of the neighborhood through the use of the blocks was tested on two parallel metaheuristics: tabu search and simulated annealing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
