頁籤選單縮合
題名 | Bicriteria Dynamic Scheduling in Multi-Machine Flowshop=雙評估準則下流程型工廠動態排程之研究 |
---|---|
作者 | 周富民; 李慶恩; | 書刊名 | 工業工程學刊 |
卷期 | 15:5 1998.09[民87.09] |
頁次 | 頁473-488 |
分類號 | 494.542 |
關鍵詞 | 所有工作完成時間; 總流程時間; 流程型工廠; 動態排程; 雙評估準則; Makespan; Total flow time; Flowshop; Dynamic scheduling; Bicriteria; |
語文 | 英文(English) |
中文摘要 | 本文針對多機流程型工廠求解雙評估準則:(1)所有工作完成時間(makespan)最小化及(2)總流程時間(total flow time)最小化加總合併下之動態排程問題。在此環境下的動態排程問題中,提出一藉由陳結事件發生時間的方式,將動態排程問題轉化成為一個靜態排程問題的解決方法。本文並針對經轉化後的靜態排程問題提出一個N��+2MN-N個變數與MN+3N條限制式的整數規劃模式,並基於求解效率之考量,本文亦提出一個複難度O(MN�纂^的啟發式排程演算法。經由實驗測試結果顯示,本文所提的啟發式排程演算法不論是在演算速度或求解品質上均具實際應用之價值。 |
英文摘要 | This paper solves a multi-machine flowshop dynamic scheduling with bicriteria problem, in which the objective function is to minimize a weighted sum of total flow time and makespan. Afrozen-event procedure is proposed to transform a dynamic scheduling problem into a atatic one. To solve the transformed static scheduling problem, a heuristic scheduling algorithm with the complexity of 0(MN ), is presented. An integer programming model with N ��+2MN-N variables and MN + 3N constraints is also formulated to validate the performance of the heuristic scheduling algorithm proposed herein. Experimental results demonstrate that the proposed algorithm can efficiently solve this problem with a high solution quality. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。