Abstract
We propose a new method of sequential and parallel speeding up of the process of solving a single machine scheduling problem with total tardiness cost function. This improvement is done on two levels: generating a neighborhood inside path relinking method (basing on new approach--blocks in solutions) and parallelization of generating paths. The obtained results are compared to the benchmark ones taken from the literature. It was possible to find new the best solutions for many benchmark instances by using the proposed method.
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.
