Solving Mixed Integer Programming Production Planning with Setups Carry-Over by Search Algorithms
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 88 === Lot-sizing models usually divide time horizon into several planning periods and assume setups cannot be carried over. However, carry-over setups are obvious in most manufacturing environment. In order to make lot-sizing problem more appropriate, we consider c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15950453199999873750 |