Abstract
This paper considers a single machine scheduling problem with deterioration and no inserted idle times. Each job has a due date, a weight and a processing time. The objective is to find an optimal sequence of the set of jobs to minimize the total weighted tardiness. To prevent premature convergence of the optimization algorithm, a genetic tabu search (GTS) algorithm is presented. In the GTS, the mutation operator is implemented with the tabu search method to enhance the local search ability. A fair comparison of genetic operators has been made between GTS and simple GA, and the experimental results show that the GTS considerably outperforms the simple GA.
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.
