Solving Economic Lot Scheduling Problem with Deteriorating Items Using an Efficient Search Algorithm
碩士 === 東海大學 === 工業工程與經營資訊學系 === 96 === The Economic Lot Scheduling Problem (ELSP) is concerned with the lot sizing and scheduling decision of n items. It has been proved that the ELSP is an NP-hard problem. In the conventional ELSP model, it does not consider the product stock could deteriorate over...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/67577437947394004774 |