Abstract
Abstract Eleven heuristic procedures are presented for sequencing n jobs on one machine to minimize the maximum job lateness when the jobs may have different ready times, processing times, and due dates. The performances of seven procedures that are shown to be representative of all eleven are evaluated on sets of sample problems against optimal solutions derived by a branch-and-bound algorithm. The main measures of each procedure's comparative quality are (1) the mean number of time units by which its solution exceeds the optimal solution and (2) the percentage of times that an optimal sequence is attained. The motivation for employing heuristic procedures is to obtain a sequence that will provide a satisfactory practical response to real world scheduling problems with minimum computational effort.
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.
