Solving the Economic Lot Scheduling Problem under General-Integer Policy Using Genetic Algorithms
碩士 === 東海大學 === 工業工程學系 === 90 === The Economic Lot Scheduling Problem (ELSP) is an NP-hard inventory problem. The solution approaches for the ELSP may be classified into two categories, i.e., analytic approaches and heuristic approaches. However, the analytic approaches, for example, dynamic program...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/18370193312221148571 |