1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 A heuristic method for a flexible flow line with unrelated parallel machines problem
作者 Chen, Chun-Lung;Chen, Chuen-Lung
陳春龍
貢獻者 資管系
關鍵詞 Heuristic algorithms; Logic programming; Problem solving; Random processes; Scheduling; Bottleneck stages; Flexibile flow line; Shortest processing time (SPT); Total flow time; Unrelated parallel machines; Parallel processing systems
日期 2006
上傳時間 21-Jul-2015 15:05:30 (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. © 2006 IEEE.
關聯 2006 IEEE Conference on Robotics, Automation and Mechatronics, 論文編號 4018789
資料類型 conference
DOI http://dx.doi.org/10.1109/RAMECH.2006.252673
dc.contributor 資管系
dc.creator (作者) Chen, Chun-Lung;Chen, Chuen-Lung
dc.creator (作者) 陳春龍zh_TW
dc.date (日期) 2006
dc.date.accessioned 21-Jul-2015 15:05:30 (UTC+8)-
dc.date.available 21-Jul-2015 15:05:30 (UTC+8)-
dc.date.issued (上傳時間) 21-Jul-2015 15:05:30 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/76733-
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. © 2006 IEEE.
dc.format.extent 176 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) 2006 IEEE Conference on Robotics, Automation and Mechatronics, 論文編號 4018789
dc.subject (關鍵詞) Heuristic algorithms; Logic programming; Problem solving; Random processes; Scheduling; Bottleneck stages; Flexibile flow line; Shortest processing time (SPT); Total flow time; Unrelated parallel machines; Parallel processing systems
dc.title (題名) A heuristic method for a flexible flow line with unrelated parallel machines problem
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1109/RAMECH.2006.252673
dc.doi.uri (DOI) http://dx.doi.org/10.1109/RAMECH.2006.252673