A hybrid approach that combines dispatching rules and tabu search for flow shop problems
碩士 === 逢甲大學 === 工業工程與系統管理學研究所 === 100 === This study combines dispatching rules and tabu search for flow shop scheduling problems with buffers. Buffers of infinite and finite sizes are considered. An initial solution is constructed by means of dispatching rules. The solution is refined by a tabu sea...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/53753233168751334337 |