haku: @indexterm Flow production / yhteensä: 48
viite: 22 / 48
| Tekijä: | Brah, S. A. Hunsucker, J. L. |
| Otsikko: | Branch and bound algorithm for the flow shop with multiple processors. |
| Lehti: | European Journal of Operational Research
1991 : MAR 6, VOL. 51:1, p. 88-99 |
| Asiasana: | FLOW PRODUCTION PRODUCTION SCHEDULING BRANCH AND BOUND METHODS |
| Kieli: | eng |
| Tiivistelmä: | The sequencing of a flow shop with multiple processors at each stage is a general case of the flow shop problem. It involves sequencing n jobs in a flow shop where, for at least one stage, the facility has one or more identical machines. The purpose now is to present a branch and bound algorithm to solve scheduling problems of such facilities for optimizing the maximum completion time. The lower bounds and elimination rulers developed in this research are based upon the generalization of the flow shop problem. A computational algorithm is also presented. |
SCIMA