:::

詳目顯示

回上一頁
題名:開放式排程交貨期啟發解之研究
作者:吳雪馥
作者(外文):Lin, Hsueh-Foo
校院名稱:國立中山大學
系所名稱:企業管理研究所
指導教授:劉常勇;劉賓陽
學位類別:博士
出版日期:1995
主題關鍵詞:數學規劃網路模式開放式工場排程Mathematical ProgrammingNetwork ModelOpen-shopScheduling
原始連結:連回原系統網址new window
相關次數:
  • 被引用次數被引用次數:期刊(0) 博士論文(0) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:32
物流中心之撿貨系統與汽車測試中心之測試作業皆為一開放式排程,開放
式排程之別於流程式與變序式排程乃是其各工作之操作順序無限制。最小
化交貨之遲延時間或遲延罰金及過早完工所產生之庫存成本或貨品損毀皆
為與貨品預定交貨期相關之排程績效評估基準。 本研究嘗試利用分割轉
換方式來證明開放式排程遲延時間最小化為一NP-hard的問題,並推論最
小化遲延罰金及過早完工所產生之庫存成本問題亦為NP-hard問題,故上
述與貨品預定交貨期相關之三種排程績效之問題適於採用啟發式解法來探
討之。本研究嘗試以數學規劃模式來描述一 n 件貨品工作訂單,m 步操
作作業程序之開放式排程中遲延時間、遲延罰金、及過早完工所產生之庫
存成本最小化,再以擴張樹之網路結構簡化數學規劃模式,並發展一閒置
時間法則作為排程決策評估選擇之基準。 本研究嘗試採用貨品工作訂單
數、操作作業程序數、貨品工作訂單遲延因數和預定交貨期分布情況不同
之三十種實驗組合中 14,400 測試個案,比較本研究發展之兩啟發式解法
與最短作業時間作業先排法、最早預定交貨期作業先排法、最小總寬裕工
作作業時間作業先排法、最小寬裕作業時間作業先排法四種派工法之績效
。實驗結果顯示本研究發展之兩啟發式解法比另四種派工法好出甚多。實
驗結果也驗證四個因素對本研究發展之兩啟發式解法的品質有影響。
The order picking operations in a physical distribution center
and the specialized testing stations in an automobile plant
containing a large quality control center are open-shop
scheduling. These open-shop schedules have no restrictions on
the processing order of the jobs. Minimizing the total
tardiness time, the total tardy cost, and the penalty of total
earliness and total tardiness are the three concerned major
criteria in an open-shop involving due dates. The problem of
minimizing the total tardiness has been proved to be NP-hard.
Therefore, the problems of minimizing the total tardy cost, or
the penalty of total earliness and total tardiness in an m-
machine deterministic nonpreemptive open-shop are also NP-hard.
A network structure based on the spanning tree is constructed
in this dissertation to simplify the mathematical model of a
nonpreemptive open-shop problem with an objective to minimize
the three criteria. The idle time rule developed in this
dissertation serves as the decision criterion. In the studied
criteria, two proposed heuristics are compared with SPT, EDD,
SLACK, and MWSTR/EST methods, using 14,400 cases. The test
cases are composed of different features, such as the number of
jobs, the number of machines, the tardiness factor, and the
range of due-date. Experimental results indicate that the
proposed heuristics perform much more efficiently than the
other four methods under the criteria studied. In this
dissertation, the characteristic of the experimental results
has also been studied to verify the factors that have influence
on the solution quality for the proposed heuristic approaches.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE