Abstract
The single machine total weighted tardiness problem with sequence-dependent setup times (often known as problem ) requires a given set of jobs to be sequenced on a single machine, where a setup time is required before the processing of each job that depends on both the preceding job and the job to be processed next. The goal is to minimise the sum of weighted tardiness, where the tardiness of a job is zero if it is completed by its due date and is equal to its completion time minus its due date otherwise. In this paper, we develop an Iterated Local Search (ILS) heuristic and compare its performance with the state-of-the-art metaheuristic algorithms from the literature. The proposed ILS algorithm obtains high-quality solutions using computation times that is comparable to its competitors.
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.
