Abstract
This paper is concerned with non-preemptive scheduling of large-scale unrelated parallel machines (UPM) with the objective of minimizing total weighted completion times (TWCT). We propose a sequential improvement local search algorithm using multiple-jump strategy embedded within Tabu search (TS) components for TWCT, and use a highly efficient data structure to provide a necessary and sufficient condition for local optimality of a solution. We will generate a set of large-scale test problems to evaluate the performance of proposed algorithm in term of scalability, solution quality and efficiency. The non-parametric tests of algorithm components will be used to validate the consistent performance across problem types and problem sizes in the proposed algorithm.
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.
