Abstract
In this paper, a heuristic procedure utilizing the adjacent pairwise interchange (API) methodology to minimize mean tardiness (\(\overline{T}\)) in single-machine scheduling is presented. Results indicate that it provides a much better solution than does the Wilkerson-Irwin heuristic algorithm, which also tries to minimize \(\overline{T}\). Experimental results suggest that the heuristic solution is not affected by problem size, which is important if larger problems are to be solved. Also, the heuristic is not affected by the tightness of due dates.
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.
