Simultaneous Pricing, Due-Date Setting and Scheduling for Make-To-Order Firms with Contingent Orders

訂單式生產環境下未確定訂單價格、交期與排程的決策模式

10.29977/JCIIE.200901.0004

劉書助(Shu-Chu Liu)；劉俊輝(Chun-Hui Liu)

同時解決價格 ； 交期與排程的問題 ； 訂單式生產 ； 未確定訂單 ； 競標模式 ； 混合搜尋法 ； simultaneous pricing ； due-date setting ； and scheduling problem SPDSP ； make-to-order MTO firms ； contingent orders ； bidding mode ； hybrid heuristic method

工業工程學刊

26卷1期（2009 / 01 / 01）

32 - 43

英文

顧客在未確定訂單由誰生產時，一般會先尋問數個有意競標的訂單式生產公司，之後再根據此資訊決定得標廠商。此詢問訂單對廠商來說即爲未確定訂單，而價格、交期和排程爲訂單式生產公司對未確定訂單的三個主要決策，因其相互影響，如何同時決定此三決策顯得相對重要。過去研究主要在有限產能下，根據最大期望利潤決定價格、交期，而排程則採一般派遣規則如先到先服務或最早交期法。本研究針對未確定訂單提出一競標模式，根據最大期望利潤，同時解決價格、交期與排程的問題。因最佳解搜尋爲NP問題(Non-polynomial problem)，故本研究採用混合搜尋法解決此問題。實驗結果顯示本研究所提出的方法相較以往研究或單一搜尋法能得到更佳利潤。

Customers may inquiry several make-to-order (MTO) firms participating in the bidding competition and then decide which bid to accept. The inquiry orders from customers are contingent orders for MTO firms. In MTO firms, pricing, due-date setting and scheduling are three major decisions for the bids regarding the contingent orders. Since they affect one another, how to determine price, due date and schedule simultaneously becomes an important issue. In the past, price and due date are determined together based on the maximal expected marginal revenue criterion under the fixed capacity constraint and some dispatching rules such as early due date (EDD), first-come-first-serve (FCFS), etc., are used for scheduling. In this paper, a bidding model for the simultaneous pricing, due-date setting and scheduling problem (SPDSP) regarding the contingent orders in MTO firms is proposed based on the maximal expected marginal revenue criterion. Since searching for the optimal solution in this model is an NP (non-polynomial) problem, a hybrid heuristic method, which overcomes the search ineffectiveness problem of pure global search heuristic methods, is proposed to solve this problem. The results show our proposed method is better than the existing methods and pure global search heuristic methods in terms of average total marginal revenue per order.

1. Cakravasti, A.,N. Nakamuraji(2002).Model for negotiating the price and due date for a single order with multiple suppliers in a make-to-order environment.International Journal of Production Research,40,3425-3440.
2. Charnsirisakskul, K.,P. Griffin,P. Keskinocak(2006).Pricing and scheduling decisions with lead time flexibility.European Journal of Operational Research,171,153-190.
3. Easton, F. F.,D. R. Moodie(1999).Pricing and lead time decisions for make-to-order firms with contingent orders.European Journal of Operational Research,116,305-318.
4. Elhafsi, M.(2000).An operational decision model for lead-time and price quotation in congested manufacturing systems.European Journal of Operational Research,126,355-370.
5. Glover, B.(1977).A statistical approach to the TSP.Networks,7,205-229.
6. Haskose, A.,B. G. Kingsman,D. Worthington(2004).Performance analysis of make-to-order manufacturing systems under different workload control regimes.International Journal of Production Economics,90,169-182.
7. Jahnukainen, J.,M. Lahti(1999).Efficient purchasing in make-to-order supply chains.International Journal of Production Economics,59,103-111.
8. Keskinocak, P.,R. Ravi,S. Tayur(2001).Scheduling and reliable lead-time quotation for orders for availability intervals and lead-time sensitive revenues.Management Science,47,264-279.
9. Kirkpatrick, S.,C. D. Gelatt,M. P. Vecchi(1983).Optimization by simulated annealing.Science,220,167-175.
10. Lederer, P. J.,L. Li(1997).Pricing, production, scheduling, and delivery-time competitive.Operations Research,45,407-420.
11. Lee, I.(2001).Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs.Computers and Operations Research,28,835-852.
12. Liu, M.,C. Wu(2006).Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems.Robotics and Computer-Integrated Manufacturing,22,279-287.
13. Park, M. W.,Y. D. Kim(1997).Search heuristic for a parallel machine scheduling problem with ready times and due dates.Computers and Industrial Engineering,33,793-796.
14. Pinedo, M.(2000).Scheduling: Theory, Algorithms, and Systems.NY:Prentice-Hall.
15. Ray, S.,E. M. Jewkes(2004).Customer lead time management when both demand and price are lead time sensitive.European Journal of Operational Research,153,769-781.
16. Skiscim, C. C.,B. L. Golden(1983).Optimization by simulated annealing: a preliminary computational study for the TSP.Proceedings of the 15th Conference on Winter Simulation,Arlington, Virginia:
17. Tan, K. C.,L. H. Lee,K. Ou(2001).Artificial intelligence heuristics in solving vehicle routing problems with time window constraints.Engineering Application of Artificial Intelligence,14,825-837.
18. Watanapa, B.,A. Techanitisawad(2005).Simultaneous price and due date settings for multiple customer classes.European Journal of Operational Research,166,351-368.
19. Webster, S.(2002).Dynamic pricing and lead-time policies for make-to-order systems.Decision Sciences,33,579-599.

1. (2013).A bi-objective differential service model for computer repairs.工業工程學刊,30(8),480-487.