勤益科大機構典藏:Item 987654321/5976
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2928/5721 (51%)
Visitors : 374327      Online Users : 912
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


    Please use this identifier to cite or link to this item: http://ir.lib.ncut.edu.tw/handle/987654321/5976


    Title: Flow shop scheduling based on a novel cooling temperature driven simulated annealing algorithm
    Authors: Sandnes, R.-M. Chen and F.E.
    Contributors: 圖書館
    Keywords: Permutation Flow Shop Problem(PFSP)
    Local search
    Simulated Annealing (SA)
    Simple Insertion with Steady Simulated Annealing (SI-SSA).
    Scheduling
    Date: 2015
    Issue Date: 2016-10-20 16:18:08 (UTC+8)
    Abstract: The Permutation Flow Shop Problem (PFSP) has been applied to many types of problems. The PFSP is an NP-hard permutation sequencing scheduling problem.
    A local search with simulated annealing scheme involving two phases is proposed in
    this investigation for solving PFSP. First, for lowering computation complexity, a simple insertion local search is applied to generate the solution of the PFSP. Second, two nondecreasing
    cooling temperature driven Simulated Annealing (SA), namely, steady SA and
    reheating SA are employed to maintain successive exploration or exploitation in the solution space. The steady SA maintains the same temperature and keeps the same search behavior and thereby allows the neighbors of the worse solutions to be explored, consequently
    increasing the chances of nding better solutions, while the reheating SA increases the temperature and exploration ability. The most important feature of the proposed method is its simple implementation and low computation time complexity. Experimental results
    are compared with other state-of-the-art algorithms and reveal that the proposed simple insertion with steady SA (SI-SSA) method is able to eciently yield the best permutation schedules.
    Relation: Sharif University of Technology Scientia Iranica B (2015) 22(4), 1545-1553
    Appears in Collections:[Department of Computer Science and Information Engineering] 【資訊工程系所】期刊論文

    Files in This Item:

    File Description SizeFormat
    Flow shop scheduling based on a novel cooling temperature driven simulated annealing algorithm.pdf967KbAdobe PDF1093View/Open


    All items in NCUTIR are protected by copyright, with all rights reserved.


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