A Comppund Incremental Cosr Function Method Used in Solving Job-Shop Flow Scheduling Problems
碩士 === 國立交通大學 === 電機與控制工程學系 === 87 === Scheduling is one of the most basic but the most difficult problem to be solved in the manufacturing system. The difficulty is that the most scheduling problems belong to the NP-Complete combinatorial problems, for which the development of efficient optimum-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98973371488179965297 |