Abstract
Each of n jobs is to be sequenced on m machines, with each job having a due date, and we wish to minimise the maximum tardiness of any job. The problem has been solved by Smith [Smith, W. E. 1956. Various optimizers for single-state production. Naval Research Logistics Quarterly 3 59–66] for the case of one machine. This note develops a branch-and-bound method for the general case.
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.
