A fast algorithm to minimize maximum lateness for the two-machine flow-shop problem
Loading...
Files
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
<p>We consider the two-machine flow-shop problem with release times where the objective is to minimize the maximum lateness. We derive a new dominance order and incorporate it into an efficient branch and bound algorithm which uses an adaptive branching scheme together with new fuzzy dominance properties for scheduling and searching. The algorithm performed very well. It solved within a few seconds more than 973 of the test problems with up to 200 jobs in a large-scale computational experiment. For the unsolved problems, the average gap between the best solution found and the optimum was less than 0.53.</p>
Description
<p>28 leaves : ; Includes bibliographical references (leaf 28). ; "June, 1999".</p> <p>This research was supported in part by the Natural Sciences and Engineering Research Council of Canada, under Grant No. OGPOOOl 798.</p>