跳到主要內容

臺灣博碩士論文加值系統

(44.220.255.141) 您好!臺灣時間:2024/11/04 02:45
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:楊肅正
研究生(外文):Suh-Jenq Yang
論文名稱:及時生產系統下多共同交貨時窗作業排程研究
論文名稱(外文):Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System
指導教授:賴建榮賴建榮引用關係
指導教授(外文):Chien-Jung Lai
學位類別:碩士
校院名稱:國立勤益科技大學
系所名稱:流通管理系
學門:商業及管理學門
學類:行銷與流通學類
論文種類:學術論文
論文出版年:2015
畢業學年度:103
語文別:中文
論文頁數:52
中文關鍵詞:及時生產系統作業排程多共同交貨時窗變動作業處理時間
外文關鍵詞:Just-in-time production systemSchedulingMultiple common due-windowsVariable processing time
相關次數:
  • 被引用被引用:0
  • 點閱點閱:174
  • 評分評分:
  • 下載下載:11
  • 收藏至我的研究室書目清單書目收藏:1
為了提升企業總體競爭力與強化顧客服務水準,及時生產系統已為許多企業採行之競爭策略之一。根據及時生產系統之核心精神,訂單提早交貨與延遲交貨均會增加成本。本研究考慮作業處理時間兼具退化效應及/或學習效應與資源配置之及時生產系統下,多共同交貨時窗之作業排程問題。研究假設共同交貨時窗的個數為事先已知,而每一個作業會被唯一指派至其中的一個共同交貨時窗。
本研究考慮兩種資源配置模式:線性函數模式和凸函數模式,每一個作業之實際處理時間與它被安排之加工順序和它的資源配置量有關,為變動的值。研究目的在決定最佳之各共同交貨時窗起始時間、各共同交貨時窗大小、指派至各共同交貨時窗之作業、各作業之資源配置量和作業排序,使得由作業提早交貨、延遲交貨、共同交貨時窗位置與大小、資源配置量及系統作業時間等成本項權重組合之成本函數為最小。
本研究推導出作業排程模式所具有的一些性質,並證明所探討問題之最佳作業排程均能以多項式時間演算法求解。本研究亦針對所提出之最佳解演算法,進行數值模擬實例驗證,並做不同參數組合之結果分析。研究所獲得之結果可應用在流通管理之餐飲服務業、物流中心揀貨配送、賣場補貨上架等作業排程上。
To cope with intensified global competition and escalating customer demand for superior service, Just-in-time production system has become a competitive strategy for many companies. According to the principle of Just-in-time production system, a company producing orders (or jobs) early, as well as late, is discouraged. This study considers multiple common due-windows assignment and scheduling problems with general position-dependent and resource-dependent processing times simultaneously in a Just-in-time production system. Multiple common due-windows allow a job to fit one from multiple common due-windows. We assume that the number of common due-windows to be assigned to the jobs is given.
In this study two resource allocation models are examined, namely the linear resource consumption model and the convex resource consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. The goal of the study is to determine jointly the optimal common due-window positions and sizes, the set of jobs assigned to each common due-window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due-windows assignment, makespan, and resource consumption costs.
We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered. We also present two numerical examples to illustrate applying algorithms proposed in the study for understanding the effect of various parameters on the optimal solution. The results of the study can be used in scheduling on distribution management, such as restaurant service, orders picking operation process in a distribution center, or replenishment operations in a hypermarket.
摘 要 i
英文摘要 ii
誌 謝 iv
目 錄 v
表目錄 vii
圖目錄 viii
一、緒論 1
1-1 研究背景 1
1-2 研究動機及目的 2
1-3 研究範圍與限制 5
1-4 研究架構與流程 6
二、文獻探討 8
2-1 作業排程簡介 8
2-2 具退化效應及學習效應作業排程 10
2-3 及時生產系統交貨時窗(間)作業排程 11
2-4 具資源配置作業排程 12
三、研究問題模式建立 15
3-1 符號定義說明 15
3-2 研究問題描述 17
四、研究問題解析 20
4-1 研究問題作業排程性質分析 20
4-2 給定各共同交貨時窗工作數 24
4-3 未給定各共同交貨時窗工作數 30
五、數值模擬驗證 33
5-1 線性函數資源配置模式最佳解實例驗證 33
5-2 凸函數資源配置模式最佳解實例驗證 36
六、研究結論與建議 39
6-1 研究結論 39
6-2 未來研究建議 40
參考文獻 42
附錄一 LINGO 11.0程式碼 49


1. Alidaee B. and Womer N. K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50, 711-729.
2. Bachman A. and Janiak A. (2004). Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society, 55, 257-264.
3. Biskup D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173-178.
4. Biskup D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315-329.
5. Browne S. and Yechiali U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495-498.
6. Brucker P. (2007). Scheduling Algorithms. New York: Springer.
7. Cheng T. C. E., Ding Q. and Lin B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1-13.
8. Cheng T. C. E., Kang L. and Ng C. T. (2004). Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 55, 198-203.
9. Cheng T. C. E. and Kovalyov M. Y. (1994). Scheduling with learning effects on job processing times, Working Paper, No. 06/94, Faculty of Business and Information Systems, The Hong Kong Polytechnic University.
10. Cheng T. C. E., Ogˇuz C. and Qi X. D. (1996). Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics, 43, 29-35.
11. Cheng T. C. E., Yang S.-J. and Yang D.-L. (2012). Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. International Journal of Production Economics, 135, 154-161.
12. Chudzik K., Janiak A. and Lichtenstein M. (2006). Scheduling problems with resource allocation. Scheduling in Computer and Manufacturing Systems. Ed. by Janiak A. Poland: Warszawa, WKL, pp.39-67.
13. Gawiejnowicz S. (2008) .Time-dependent Scheduling. New York: Springer.
14. Gerstl E. and Mosheiov G. (2012). Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Information Processing Letters, 112, 743-747.
15. Gordon V. S., Proth J. M. and Chu C. (2002). A survey of the state-of-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1-25.
16. Gordon V. S., Proth J. M. and Strusevich V. A. (2004). Scheduling with due date assignment. Handbook of Scheduling: Algorithms, Models and Performance Analysis, Ed. by Leung, J. Y., CRC Press, Boca Raton, FL.
17. Graham R. L., Lawler E. L., Lenstra J. K. and Rinnooy Kan A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287-326.
18. Hardy G. H., Littlewood J. E. and Polya G. (1967). Inequalities. London: Cambridge University Press.
19. Heizer J. and Render B. (2004). Principles of Operations Management. New Jersey: Pearson Education Inc.
20. Hsieh P.-H., Yang S.-J. and Yang D.-L. (2015). Decision support for unrelated parallel machine scheduling with discrete controllable processing times. Applied Soft Computing, 30, 475-483.
21. Hsu C.-J., Yang S.-J. and Yang D.-L. (2011). Two due date assignment problems with position-dependent processing time on a single-machine. Computers & Industrial Engineering, 60, 796-800.
22. Janiak A. (1989). Minimization of the blooming mill standstills-mathematical model, suboptimal algorithms. Mechanika, 8(2), 37-49
23. Janiak A. and Kovalyov M. Y. (2006). Scheduling deteriorating jobs. Scheduling in Computer and Manufacturing Systems. Ed. by Janiak A. Poland: Warszawa, WKL, pp.12-25.
24. Janiak A. and Rudek R. (2006). Scheduling problems with position dependent job processing times. Scheduling in Computer and Manufacturing Systems. Ed. by Janiak A. Poland: Warszawa, WKL, pp.26-38.
25. Janiak A. and Rudek R. (2009). Experience based approach to scheduling problems with the learning effect. IEEE Transactions on Systems, Man, and Cybernetics-Part A, 39, 344-357.
26. Ji M. and Cheng T. C. E. (2008). Parallel-machine scheduling with simple linear deterioration to minimize total completion time. European Journal of Operational Research, 188, 342-347.
27. Ji M., Ge J., Chen K. and Cheng T. C. E. (2013). Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity. Computers & Industrial Engineering, 66, 952-961.
28. Ji M., Yao D., Yang Q. and Cheng T. C. E. (2015). Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity. International Transactions in Operational Research, DOI:10.1111/itor.12121.
29. Jozefowska J. (2007). Just-in-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. New York: Springer.
30. Kaspi M. and Shabtay D. (2003). Optimization of machining economics problem for a multi-stage transfer machine under failure, opportunistic and integrated replacement strategies. International Journal of Production Research, 41, 2229-2248.
31. Kayan R. K. and Akturk M. S. (2005). A new bounding mechanism for the CNC machine scheduling problem with controllable processing times. European Journal of Operational Research, 167, 624-643.
32. Kunnathur A. S. and Gupta S. K. (1990). Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. European Journal of Operational Research, 47, 56-64.
33. Kuo W.-H. and Yang D.-L. (2006). Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 174, 1184-1190.
34. Kuo W.-H. and Yang D.-L. (2008). A note on due-date assignment and single-machine scheduling with deteriorating jobs. Journal of the Operational Research Society, 59, 857-859.
35. Liman S. D., Panwalkar S. S. and Thongmee S. (1997). A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research, 70, 145-154.
36. Liman S. D., Panwalkar S. S. and Thongmee S. (1998). Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society, 49, 1007-1010.
37. Mellor P. (1966). A review of job shop scheduling. Operational Research Quarterly, 17(2), 161-170.
38. Mosheiov G. (1995). Scheduling jobs with step-deterioration: Minimizing makespan on a single- and multi-machine. Computers & Industrial Engineering, 28, 869-879.
39. Mosheiov G. and Sarig A. (2008). A due-window assignment problem with position-dependent processing times. Journal of the Operational Research Society, 59, 997-1003.
40. Mosheiov G. and Sarig A. (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers & Operations Research, 36, 2541-2545.
41. Mosheiov G. and Sidney J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665-670.
42. Nowicki E. and Zdrzalka S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, 271-287.
43. Panwalkar S. S., Smith M. L. and Seidmann A. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391-399.
44. Papadimitriou C. H and Steiglitz K. (1982). Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall.
45. Pinedo M. L. (2008). Scheduling: Theory, Algorithms, and Systems. New York: Springer.
46. Sidney J. (1977). Optimal single-machine scheduling with earliness and tardiness penalties. Operations Research, 25, 62-69.
47. Shabtay D. and Steiner G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155, 1643-1666.
48. Shabtay D. and Steiner G. (2008). The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operations Research, 159, 25-40.
49. Trick M. (1994). Scheduling multiple variable-speed machines. Operations Research, 42, 234-248.
50. Vickson R. G. (1980a) Choosing the job sequence and processing times to minimize processing plus flow cost on a single machine. Operations Research, 28, 1155-1167.
51. Vickson R. G. (1980b). Two single-machine sequencing problems involving controllable job processing times. AIIE Transactions, 12, 258-262.
52. Wan G. (2007). Single machine common due window scheduling with controllable job processing times. Lecture Notes in Computer Science, 4616, 279-290.
53. Wang J.-B. and Wang C. (2011). Single-machine due-window assignment problem with learning effect and deteriorating jobs. Applied Mathematical Modelling, 35, 4017-4022.
54. Wright T. P. (1936). Factors affecting the cost of airplanes. Journal of Aeronautical Sciences, 3, 122-128.
55. Wu C.-C., Lee W.-C. and Shiau Y.-R. (2007). Minimizing the total weighted completion time on a single-machine under linear deterioration. International Journal of Advanced Manufacturing Technology, 33, 1237-1243.
56. Yang D.-L., Lai C.-J. and Yang S.-J. (2014). Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. International Journal of Production Economics, 150, 96-103.
57. Yang S.-J. and Yang D.-L. (2010). Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities. Computers & Mathematics with Applications, 60, 2161-2169.
58. Yang S.-J., Yang D.-L. and Cheng T. C. E. (2010). Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Computers & Operations Research, 37, 1510-1514.
59. Yin Y., Cheng T. C. E., Wu C.-C. and Cheng S.-R. (2014). Single-machine due window assignment and scheduling with a common allowance and controllable job processing time. Journal of the Operational Research Society, 65, 1-13.
60. Zhao C.-L., Zhang Q. and Tang H.-Y. (2003). Scheduling problems under linear deterioration. Acta Automatica Sinica, 29, 531-535.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top