A Heuristic Algorithm for Makespan Minimization of a Flow Shop Scheduling Problem - A Study on Master Production Schedule in TFT-LCD Company
碩士 === 中原大學 === 工業與系統工程研究所 === 101 === The main purpose of this thesis is to solve the flow shop scheduling problems in LCD manufacturing company. A heuristic algorithm is proposed to minimize both the idle time of machines and makespan. In order to evaluate the effectiveness of the heuristic, we co...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90977795397884980264 |