Scheduling in Two-machine Flowshops with Supportive Precedence Relations
碩士 === 國立交通大學 === 資訊管理研究所 === 97 === Since the introduction of the flowshop scheduling problem by Johnson in 1954, scheduling in flowshops has drawn much research attention. This thesis considers scheduling in flowshops with supportive precedence relations. The model originates from a real productio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Online Access: | http://ndltd.ncl.edu.tw/handle/57042649880606419566 |