訂單優先權策略對於排程管理影響之研究－以腳踏車生產供應鏈為例

The Impact of Preemptive Order Strategies on the Supply Chain Management-A Case for Bicycle Manufacturing

10.29836/LMR.200512.0009

李來錫(Lai-Hsi Lee)；林中信(Chung-Sin Lin)；方靜琪(Chin-Chi Fung)

優先權策略 ； 生產排程 ； 系統模擬 ； Preemptive Order Strategies ； Scheduling ； Simulation

運籌管理評論

1卷1期（2005 / 12 / 01）

101 - 109

繁體中文

本文以Bock與Patterson (1990)提出的三種優先權策略：(1)無優先權策略(NPR)、(2)絕對優先權策略(APR)、(3)限制性優先權策略(LPR)為基礎，探討在不同的策略下對於生產系統的各項生產時間變化情形，藉以分析具優先權訂單對於整體生產系統的影響。本研究以一腳踏車生產流程做為範例，依三種不同的優先權策略進行生產流程模擬，觀察在不同策略下整體生產時間與延遲時間的變化，研究的結果將可以協助企業進行適當的策略評估，以降低訂單插件對整體生產效率的衝擊。

Supply chain management can increase productivity through efficiently use of equipments and manpower. However, preemptive orders occur with delivery deadline or other cost reasons that might decrease the productivity. This paper is aim to discuss proper preemptive order strategies based on three preemption strategies (Bock and Patterson, 1990): no preemption of resources (N (LPR). The th PR), absolute priority for resources (APR), and limited priority for resourcesree preemption rules are examined by an example of a production process for producing bicycles. The related data are collected by simulation with two observations: the production time and the delay duration. The results show that proper use of order preemptive strategies can reduce the impact of order preemption.

1. Albers, S.,Schmidt, G.(2001).Scheduling with Unexpected Machine Breakdowns.Discrete Applied Mathematics,110(2/3),85-99.
2. Baptiste, P.,Timkovsky, V.G.(2001).On Preemption Redundancy in Scheduling Unit Processing Time Jobs on Two Parallel Machines.Operations Research Letters,28(5),205-212.
3. Bashyam, T.C.A.(1996).Competitive Capacity Expansion under Demand Uncertainty.European Journal of Operational Research,95,89-114.
4. Bock, D.B.,Patterson, J.H.(1990).A Comparison of Due Date Setting, Resource Assignment, and Job Preemption Heuristics for the Multiproject Scheduling Problem.Decision Science,21,387-402.
5. Brasel, H.,Hennes, H.(2004).On the Open-Shop Problem with Preemption and Minimizing the Average Completion Time.European Journal of Operational Research,157(3),607-619.
6. Brucker, P.,Heitmann, S.,Hurink, J.(2003).How Useful are Preemptive Schedules?.Operations Research Letters,31(2),129-136.
7. Chang, S.,Kim, Y.H.(2002).Minimizing Makespan in a Two-machine Flowshop with Dynamic Arrivals.Computers and Operations Research,29(3),275-294.
8. Della, C.F.,T''kindt, V.(2003).Improving the Preemptive Bound for the One-Machine Dynamic Total Completion Time Scheduling Problem.Operations Research Letters,31(2),142-148.
9. do Val, J.B.R.,Salles, J.L.F.(1999).Optimal Production with Preemption to Meet Stochastic Demand.Automatica,35(11),1919-1828.
10. Du, D.(2004).Optimal Preemptive Semi-Online Scheduling on Two Uniform Processors.Information Processing Letters,92(5),219-223.
11. Dumond, E.J.,Dumond, J.(1993).An Examination of Resourcing Policies for the Multi-resource Problem.International Journal of Operations and Production Management,13(5),54-76.
12. Dumond, J.(1992).In a Multi-resource Environment, How Much is Enough?.International Journal of Production Research,30(2),395-410.
13. Epstein, L.(2000).A Note on On-line Scheduling with Precedence Constraints on Identical Machines.Information Processing Letters,76(4/6),149-153.
14. Liu, Z.,Cheng, T.C.E.(2002).Scheduling with Job Release Dates, Delivery Times and Preemption Penalties.Information Processing Letters,82,107-111.
15. Liu, Z.,Sanlaville, E.(1995).Preemptive Scheduling with Variable Profile, Precedence Constrains and Due Dates.Discrete Applied Mathematics,58(3),213-229.
16. Phillips, C.,Stein, C.,Wein, J.(1998).Minimizing Average Completion Time in the Presence of Release Dates.Mathematical Programming,82(1/2),199-223.
17. Sanlaville, E.(1995).Nearly on Line Scheduling of Preemptive Independent Tasks.Discrete Applied Mathematics,57(2/3),229-241.
18. Wen, J.,Du, D.(1998).Preemptive On-Line Scheduling for Two Uniform Processors.Operations Research Letters,23(3/5),113-116.
19. Yun, Y.S.,Gen, M.(2002).Advanced Scheduling Problem Using Constraint Programming Techniques in SCM Environment.Computers and Industrial Engineering,43(1/2),213-229.