查詢結果分析
來源資料
相關文獻
- Operations Scheduling for the Robot-Centered Parallel-Processor Workcell
- A Branch and Bound Algorithm for Scheduling Problem of a Robot-Centered Manufacturing Cell
- 以機器人為中心的平行處理機單元系統之排程問題研究
- A Bottleneck-Based Group Scheduling Procedure for Job-Shop Cells
- 彈性製造單元物流控制之三階段開發程序
- Effect of Cell Transfer Batches on Group Scheduling in a Flow Shop Cellular System
- Minimizing Makesapn of Flow Line Cells by Bottleneck-based Group Scheduling
- 有關流程型工廠群組排程利用分枝界限法求解之探討
- A Ctpn-Based Scheduler for a Flexible Manufacturing Cell
- 動態進出彈性製造單元之衝突資源派工排程系統
頁籤選單縮合
題 名 | Operations Scheduling for the Robot-Centered Parallel-Processor Workcell=機器人為中心的平行處理機製造單元操作性排程 |
---|---|
作 者 | 林則孟; 溫于平; 胡淑珍; | 書刊名 | 中國工程學刊 |
卷 期 | 14:3 1991.05[民80.05] |
頁 次 | 頁311-318 |
分類號 | 448.94 |
關鍵詞 | 平行處理機; 排程; 單元; 製造; 操作性; 機器人; |
語 文 | 英文(English) |
中文摘要 | 本文主要探討以機器人為中心的平行處理機製造單元之操作性排程問題。在此製 造單元中,假設有 n 個工作準備在 m 個相同的機器上加工,而由一部機器手臂負責將工件 裝、卸動作,如何來安排機器手臂的動作順序以使總完成時間為最小。首先,本文提出了一 個混合式的整數規劃模式來表達問題的特質。由於此規劃問題為一耗時且高難度的問題,因 此提出三個易於執行的啟發式解以求得趨近最佳解。其實驗結果與分析亦附於文中。 |
英文摘要 | In this paper, the problem of scheduling robot operatins for a robot- centered parallel-processor cell is considered. N parts and m identical processors are assumed in the cell, a robot is responsible for both loading and unloading the parts, and the schedule of robot activities is to minimize the makespan. A mixed integer program is formulated to describe the characteristics of the problem. However, in the case of a large number of parts, it is not easy to obtain an optimal solution because of inordinate computational time. Therefore, three heuristic algorithms are proposed to get an approximately optimal schedule. The number of processors and the interval of the ratio of loading time to processing time are shown to have significant effects on the performance of heuristic algorithms. Experimental results and analyses are presented. |
本系統中英文摘要資訊取自各篇刊載內容。