Some Generalized Two-Machine Flowshop Scheduling Problem
博士 === 國立清華大學 === 工業工程研究所 === 82 === Since Johnson, in his pioneering work, proposed a polynominal time algorithm for the two-machine flowshop scheduling problem. The flowshop scheduling problems have been studied extensively. However, due to the simplici...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/66011464809492698777 |