English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88987/118697 (75%)
Visitors : 23578826      Online Users : 243
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/73504
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/73504


    Title: A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
    Authors: 陳春龍
    Chen, Chun-Lung;Chen, Chuen-Lung
    Contributors: 資管系
    Keywords: Bottleneck-based multiple insertion heuristic;Flexible flow line;Bottleneck, Unrelated parallel machines;Makespan
    Date: 2009-11
    Issue Date: 2015-02-12 14:44:43 (UTC+8)
    Abstract: This study developed a bottleneck-based heuristic (BBFFL) to solve a flexible flow line problem with a bottleneck stage, where unrelated parallel machines exist in all the stages, with the objective of minimizing the makespan. The essential idea of BBFFL is that scheduling jobs at the bottleneck stage may affect the performance of a heuristic for scheduling jobs in all the stages. Therefore, in BBFFL, a variant of Johnson's rule is used to develop a bottleneck-based initial sequence generator (BBISG). Then, a bottleneck-based multiple insertion procedure (BBMIP) is applied to the initial sequence to control the order by which jobs enter the bottleneck stage to be the same as that at the first stage. Five experimental factors were used to design 243 different production scenarios and 10 test problems were randomly generated in each scenario. These test problems were used to compare the performance of BBFFL with several well-known heuristics. Computational results show that the BBFFL significantly outperforms all the well-known heuristics.
    Relation: Computers & Operations Research,36(11),3073-3081
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.cor.2009.02.004
    DOI: 10.1016/j.cor.2009.02.004
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML807View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback