haku: @indexterm Scheduling / yhteensä: 635
viite: 225 / 635
| Tekijä: | Nagar, A. Heragu, S. Haddock, J. |
| Otsikko: | A branch-and-bound approach for a two-machine flowshop scheduling problem |
| Lehti: | Journal of the Operational Research Society
1995 : JUN, VOL. 46:6, p. 721-734 |
| Asiasana: | OPERATIONAL RESEARCH SCHEDULING BRANCH AND BOUND METHODS |
| Kieli: | eng |
| Tiivistelmä: | In this paper, the authors present a branch-and-bound approach for solving a two-machine flow shop scheduling problem , in which the objective is to minimize a weighted combination of job flowtime and schedule makespan. Experimental results show that the algorithm works very well for certain special cases and moderately well for others. In fact, it is able to produce optimal schedules for 500-job problems in which the second machine dominates the first machine. |
SCIMA