haku: @indexterm Scheduling / yhteensä: 635
viite: 131 / 635
Tekijä: | Ben-Daya, M. Al-Fawsan, M. |
Otsikko: | A tabu search approach for the flow shop scheduling problem |
Lehti: | European Journal of Operational Research
1998 : AUG 16, VOL. 109:1, p. 88-95 |
Asiasana: | FLOW PRODUCTION SCHEDULING SHOPS |
Kieli: | eng |
Tiivistelmä: | In this paper, the authors propose a tabu search approach for solving the permutation flow shop scheduling problem. The proposed implementation of the tabu search approach suggests simple techniques for generating neighborhoods of a given sequence and a combined scheme for intensification and diversification that has not been considered before. These new features results in an implementation that improves upon previous tabu search implementations that use mechanisms of comparable simplicity. |
SCIMA