Name
Abstract | ||
|---|---|---|
Branch-and-bound methods are commonly used to find a permutation schedule that minimizes maximum completion time in an m-machine flow-shop. In this paper we describe a classification scheme for lower bounds that generates most previously known bounds and leads to a number of promising new ones as well. After a discussion of dominance relations within this scheme and of the implementation of each bound, we report on computational experience that indicates the superiority of one of the new bounds. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1287/opre.26.1.53 | Operations Research |
Field | DocType | Volume |
Mathematical optimization,Classification scheme,Permutation,Flow shop scheduling,Mathematics,Bounding overwatch | Journal | 26 |
Issue | ISSN | Citations |
1 | 0030-364X | 70 |
PageRank | References | Authors |
11.01 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. J. Lageweg | 1 | 274 | 117.55 |
| J. K. Lenstra | 2 | 1689 | 329.39 |
| A. H. G. Rinnooy Kan | 3 | 2109 | 497.45 |