Bidding Decision Based on a Rolling Horizon Available-to-Promise Mechanism: Solution by Fuzzy Approach and Genetic Algorithm
碩士 === 淡江大學 === 資訊管理學系碩士班 === 97 === This study integrates the bidding decision and production planning based on the concept of advanced available-to-promise (AATP) inventory with a rolling planning horizon. Customer requests arrive in a random fashion, and bidding decisions are made for a batch of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23804364895241084348 |
| Summary: | 碩士 === 淡江大學 === 資訊管理學系碩士班 === 97 === This study integrates the bidding decision and production planning based on the concept of advanced available-to-promise (AATP) inventory with a rolling planning horizon. Customer requests arrive in a random fashion, and bidding decisions are made for a batch of requests collected over a batching interval. This decision process repeated for every specified batching interval, and the current decision-making must take into account the previously committed orders in earlier phases. The problem is formulated as a mixed integer programming model with fuzzy constraints, which express the decision-maker’s subjective judgment regarding customer’s price tolerance. The proposed model embeds the AATP concept to support accurate computation of profit and customer order promising. A genetic algorithm is developed to solve the problem. Performance of the proposed approach is evaluated through experiments conducted by computer simulation.
|
|---|