English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88987/118693 (75%)
Visitors : 23571116      Online Users : 231
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/76733
    Please use this identifier to cite or link to this item: http://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 SizeFormat

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback