|
|||||
|
|
An improved branch and bound procedure for n × m flow shop problems |
|
| Authors: | S. S. Panwalkar A. W. Khan |
| Abstract: | This paper considers the classical nXm flow shop sequencing problem. An improved branch and bound procedure is proposed. Computational experience shows that the proposed procedure is more efficient compared to the existing optimizing procedures. |
| Keywords: | |