政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/76733

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113656/144643 (79%)
Visitors : 51713755 Online Users : 805

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 > Item 140.119/76733

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/76733

Title:	A heuristic method for a flexible flow line with unrelated parallel machines problem
Authors:	Chen, Chun-Lung;Chen, Chuen-Lung 陳春龍
Contributors:	資管系
Keywords:	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
Date:	2006
Issue Date:	2015-07-21 15:05:30 (UTC+8)
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.
Relation:	2006 IEEE Conference on Robotics, Automation and Mechatronics, 論文編號 4018789
Data Type:	conference
DOI 連結:	http://dx.doi.org/10.1109/RAMECH.2006.252673
DOI:	10.1109/RAMECH.2006.252673
Appears in Collections:	[資訊管理學系] 會議論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML2	949	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...