Abstract
A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.
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.
