學術產出-會議論文
文章檢視/開啟
書目匯出
Google ScholarTM
政大圖書館
引文資訊
-
No data in Web of Science(Wrong one)資料載入中...
TAIR相關學術產出
| 題名 | A Heuristic Method for a Flexible Flow Line with Unrelated Parallel Machines Problem |
| 作者 | Chen, Chuen-lung 陳春龍 |
| 貢獻者 | 資管系 |
| 日期 | 2006 |
| 上傳時間 | 17-六月-2015 17:20:28 (UTC+8) |
| 摘要 | The problem considered in this paper is a flexible flow line with multiple serial stages, where there are one or more unrelated parallel machines at each stage and there exists a bottleneck stage in the system. The objective of the scheduling problem is to minimize the total flow time of jobs. A heuristic method is proposed to solve the scheduling problem. It focuses on the bottleneck stage and a heuristic procedure is developed as part of the method to construct the schedule for the bottleneck stage. This is because the bottleneck stage may not be the first; the arrival time of jobs at the bottleneck stage may not be zero. A trial simulation is adopted to schedule the jobs at the stages ahead of the bottleneck stage so as to obtain the arrival time of jobs at the bottleneck stage. To evaluate the performance of the suggested method, the shortest processing time (SPT) dispatching rule is investigated for comparison purposes and computational experiments are performed on randomly generated test problems. Results show that the suggested method performs better than the SPT dispatching rule for various test problems |
| 關聯 | Robotics, Automation and Mechatronics - RAM |
| 資料類型 | conference |
| DOI | http://dx.doi.org/10.1109/RAMECH.2006.252673 |
| dc.contributor | 資管系 | |
| dc.creator (作者) | Chen, Chuen-lung | |
| dc.creator (作者) | 陳春龍 | zh_TW |
| dc.date (日期) | 2006 | |
| dc.date.accessioned | 17-六月-2015 17:20:28 (UTC+8) | - |
| dc.date.available | 17-六月-2015 17:20:28 (UTC+8) | - |
| dc.date.issued (上傳時間) | 17-六月-2015 17:20:28 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/75934 | - |
| dc.description.abstract (摘要) | The problem considered in this paper is a flexible flow line with multiple serial stages, where there are one or more unrelated parallel machines at each stage and there exists a bottleneck stage in the system. The objective of the scheduling problem is to minimize the total flow time of jobs. A heuristic method is proposed to solve the scheduling problem. It focuses on the bottleneck stage and a heuristic procedure is developed as part of the method to construct the schedule for the bottleneck stage. This is because the bottleneck stage may not be the first; the arrival time of jobs at the bottleneck stage may not be zero. A trial simulation is adopted to schedule the jobs at the stages ahead of the bottleneck stage so as to obtain the arrival time of jobs at the bottleneck stage. To evaluate the performance of the suggested method, the shortest processing time (SPT) dispatching rule is investigated for comparison purposes and computational experiments are performed on randomly generated test problems. Results show that the suggested method performs better than the SPT dispatching rule for various test problems | |
| dc.format.extent | 130 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Robotics, Automation and Mechatronics - RAM | |
| dc.title (題名) | A Heuristic Method for a Flexible Flow Line with Unrelated Parallel Machines Problem | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1109/RAMECH.2006.252673 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1109/RAMECH.2006.252673 |