查詢結果分析
來源資料
頁籤選單縮合
題 名 | A Two-Stage Multi-Family Flowshop Batch Processing Scheduling Problem=雙階段多群族流線型批次排程問題之研究 |
---|---|
作 者 | 楊達立; 陳茂生; | 書刊名 | 南開學報 |
卷 期 | 2 1997.06[民86.06] |
頁 次 | 頁285+287-295 |
分類號 | 494.5 |
關鍵詞 | 流線型排程; 批次處理機器; Flowshop scheduling; Batch processing machine; |
語 文 | 英文(English) |
中文摘要 | 本研究探討一雙階段多群族流線型批次排程問題考量不同的工作在批次處理機器 上具有不同的體積大小。批次處理機器能夠同時處理數個工作當成一批次。當某一批次開 始接受處理時,被安排在此批次裡的工作不能脫離處理,直到整個批次都處理完畢。我們考 慮一序列問題定義在雙機梳線型排程問題上,其中第一階段可能是批次處理機器或第二階段 是批次處理機器。相同的群族具有相同的工作且同一群族均處理完後才可處理另一群族。每 個群族在開始與結束時均需裝置與卸機時間,目標在縮短最小完成時間。在本研究中我們提 出一多項式時間演算法用來求解此問題。 |
英文摘要 | Wc consider a two-stage multi-family flowshop scheduling problem with n on-identical capacity requirements or sizes on a batch processing machine. A batch processing machine is one which can process a number of jobs simultaneously as a batch. Once the process begins, no job can be released from the batch processing machine until the entire batch is processed. We consider a class of problems defined by a two-machine flwoshop where one of the machines is a batch processing machine. There are identical jobs in the same family and must be processed in succession. Each family requires a setup time and removal time on both machines. The objective to minimize the makespan. We propose a polynomial time algorithm to solve this problem. |
本系統中英文摘要資訊取自各篇刊載內容。