A fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.
|Number of pages||17|
|Journal||Discrete applied mathematics|
|Publication status||Published - 13 Jun 1997|