Abstract
Abstract An optimal procedure is developed for the sequencing of n-jobs on one machine to minimize the maximum job lateness when the n-jobs have unequal early start times and due dates. The decision rule derived for the procedure primarily sequences the jobs in order of their nondecreasing early starts plus due dates. A branch-and-bound approach is employed by the procedure which moves to opti-mality in a finite number of steps.
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.
