Abstract
The problem considered in this paper is a set of independent jobs on unrelated parallel machines with sequence-dependent setup times and unequal ready times so as to minimize total weighted number of tardy jobs. An iterated local search (ILS) is developed to solve the problem. It employs a swap shaking procedure and a tabu search algorithm with hybrid neighborhoods to ensure high ILS effectiveness and efficiency. To evaluate the performance of the suggested heuristic, some heuristic rules, a conventional tabu search algorithm, and optimal solutions are examined for comparison purposes. The computational experimental results show that the proposed ILS is a promising method for solving this problem.
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.
