Abstract
We consider the scheduling problem to minimize the total tardiness of a job set keeping the number of tardy jobs to its minimum value. A simple algorithm is presented to obtain an optimal sequence when the set of tardy jobs is specified. A set of properties is presented that explores the structure induced by the minimum number of tardy jobs requirement. The general problem is solved optimally by employing an efficient Branch & Bound (B&B) search that takes advantage of the theory developed. We identify special cases where the Moore-Hodgson algorithm can be applied to find the optimal tardy job set. Computational experiments show that the B&B algorithm solves relatively large instances in just a few seconds, on a personal computer.
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.
