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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113318/144297 (79%)
Visitors : 51061077 Online Users : 999

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

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大典藏 > College of Commerce > Department of MIS > Periodical Articles > Item 140.119/73506

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

Title:	Bottleneck-based heuristics to minimize tardy jobs in a flexible flow line with unrelated parallel machines
Authors:	陳春龍 Chen, Chun-Lung
Contributors:	資管系
Keywords:	Bottleneck-based heuristics;Flexible flow line;Unrelated parallel machines
Date:	2008
Issue Date:	2015-02-12 14:44:52 (UTC+8)
Abstract:	This paper develops new bottleneck-based heuristics with machine selection rules to solve the flexible flow line problem with unrelated parallel machines in each stage and a bottleneck stage in the flow line. The objective is to minimize the number of tardy jobs in the problem. The heuristics consist of three steps: (1) identifying the bottleneck stage; (2) scheduling jobs at the bottleneck stage and the upstream stages ahead of the bottleneck stage; (3) using dispatching rules to schedule jobs at the downstream stages behind the bottleneck stage. A new approach is developed to find the arrival times of the jobs at the bottleneck stage, and two decision rules are developed to schedule the jobs on the bottleneck stage. This new approach neatly overcomes the difficulty of determining feasible arrival times of jobs at the bottleneck stage. In order to evaluate the performance of the proposed heuristics, six well-known dispatching rules are examined for comparison purposes. Six factors are used to design 729 production scenarios, and ten test problems are generated for each scenario. Computational results show that the proposed heuristics significantly outperform all the well-known dispatching rules. An analysis of the experimental factors is also performed and several interesting insights into the heuristics are discovered.
Relation:	International Journal of Production Research,46(22),6415-6430
Data Type:	article
DOI link:	http://dx.doi.org/10.1080/00207540701352102
DOI:	10.1080/00207540701352102
Appears in Collections:	[Department of MIS] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML2	1072	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...