:::

詳目顯示

回上一頁
題名:機械製造業生產排程與插單重排程之研究
書刊名:環球科技人文學刊
作者:杜宇平
作者(外文):Tu, Yu-ping
出版日期:2012
卷期:14
頁次:頁57-70
主題關鍵詞:生產排程近代啟發式解法緊急插單重排程限制規劃Production schedulingMeta-heuristicRich ordersReschedulingConstraint programming
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:6
  • 點閱點閱:35
近年來由於新科技的運用、國際化的趨勢及消費者意識的覺醒,使得機械產業結構逐漸改變,自大量化的生產,轉變為少量多樣與客製化、彈性化的生產,生產排程的良窳便成為反應工廠應變能力與競爭力之關鍵。對於機械製造業而言,常見的排程方式多以最小到期日之派工法則為主,當實務上遇到緊急插單時,所執行之重排程多需大幅更動原有排程結果,而造成物料不足或過剩之情形,亦影響生產排程之管控。若在緊急插單重排程時,能減少重排程的變異幅度與時程範圍,將可減少生產排程不斷改變的衝擊。有鑑於此,本研究以國內機械製造業為研究對象,於生產排程部份,提出以滿足顧客需求及庫存成本最小化,並以產品完工日與預定交貨日相距最小化為目標之生產排程數學模式;而在緊急插單重排程部份,以不擾動原有訂單之生產排程下,提出滿足顧客需求及庫存成本最小化為目標之緊急插單重排程數學模式,並針對此兩個數學模式,以限制規劃為基礎之近代啟發式解法求解。為驗證本研究所提出之排程模式與求解方法具實務應用之可行性,本研究以國內一機械製造業者之實務資料加以分析與測試。與此公司以派工方式之排程比較,於產品如期完工、整體產能運用及生產排程擾動最小,本研究所提出之排程模式架構均具有較佳之效率,可有效解決此公司生產排程之困擾,亦可提供其他產業遭遇相類似問題時之參考用。
期刊論文
1.駱景堯(199909)。禁忌搜尋法在彈性零工型製造系統排程之探討。工業工程學刊,16(5),605-615。new window  延伸查詢new window
2.Liaw, Ching-Fang(2004)。Scheduling two-machine preemptive open shops to minimize total completion time。Computers & Operations Research,31,1349-1363。  new window
3.Liaw, Ching-Fang、Cheng, Chun-Yuan、Chen, Mingchih(2002)。The total completion time open shop scheduling problem with a given sequence of jobs one machine。Computers & Operations Research,29,1251-1226。  new window
4.Junker, U.、Nuijten, W.(1999)。Preference-based Search for Minimizing Changes in Rescheduling。IJCIA,99。  new window
5.Christian, A.、Jean-Charles, B.、Carl, E.(2005)。Maximization of solution flexibility for robust shop scheduling。European Journal of Operational Research,165,314-328。  new window
6.Schaller, Jeffrey(2004)。Single machine scheduling with early and quadratic tardy penalties。Computers & Industrial Engineering,46,511-532。  new window
7.Laborie, P.、Ghallab, M.(1995)。Planning with Sharable Resource Constraints。IJCAI,95,1643-1649。  new window
8.Parunak, H. V. D.(1991)。Characterizing the Manufacturing Scheduling Problem。Journal of Manufacturing Systems,10,241-259。  new window
9.Sawik, Tadeusz(2001)。Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line。European Journal of Operational Research,143,115-124。  new window
10.Ladhari, Talel、Haouari, Mohamed(2005)。A computational study of the permutation flow shop problem based on a tight lower bound。Computers & Operations Research,32,1831-1847。  new window
11.Vieira, G. E.(20020314)。Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Method。Journal of Scheduling。  new window
12.Armentano, Vinicius A.、Scrich, Cintia Rigão(2000)。Tabu search for minimizing total tardiness in a job shop。International Journal of Production Economics,63,131-140。  new window
13.Church, L. K.、Uzsoy, R.(1992)。Analysis of periodic and event-driven rescheduling policies in dynamic shops。International Journal of Computer Integrated Manufacturing,5(3),153-163。  new window
14.Brailsford, Sally C.、Potts, Chris N.、Smith, Barbara M.(1999)。Constraint Satisfaction Problems: Algorithms and Applications。European Journal of Operational Research,119,557-581。  new window
15.吳鴻輝、李榮貴(19970400)。生產排程之重排程決策問題的文獻探討與分析。工業工程學刊,14(2),147-158。new window  延伸查詢new window
16.Tahar, Djamel Nait、Yalaoui, Farouk、Chu, Chengbin、Amodeo, Lionel(2006)。A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times。International Journal of Production Economics,99,63-73。  new window
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
:::
無相關博士論文
 
無相關書籍
 
無相關著作
 
QR Code
QRCODE