Abstract
The n-job, single-machine total tardiness problem is considered in this paper. A branching algorithm based on three theorems is proposed to generate a reduced set of candidate sequences. The computational results indicate that the proposed algorithm provides a smaller set of candidate sequences than the DP algorithm of Schrage and Baker.
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.
