淡江大學機構典藏:Item 987654321/21070
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4015966      Online Users : 536
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/21070


    Title: A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines
    Authors: 周清江;Jou, Chi-chang
    Contributors: 淡江大學資訊管理學系
    Keywords: Production scheduling;Genetic algorithms;Flow shop;Parallel machines
    Date: 2005-01
    Issue Date: 2009-11-30 13:12:50 (UTC+8)
    Publisher: Elsevier
    Abstract: Production scheduling seeks optimal combination of short manufacturing time, stable inventory, balanced human and machine utilization rate, and short average customer waiting time. Since the problem in general has been proven as NP-hard, we focus on suboptimal scheduling solutions for parallel flow shop machines where jobs are queued in a bottleneck stage. A Genetic Algorithm with Sub-indexed Partitioning genes (GASP) is proposed to allow more flexible job assignments to machines. Our fitness function considers tardiness, earliness, and utilization rate related variable costs to reflect real requirements. A premature convergence bounce is added to traditional genetic algorithms to increase permutation diversity. Finally, a production scheduling system for an electronic plant based on GASP is implemented and illustrated through real production data. The proposed GASP has demonstrated the following advantages: (1) the solutions from GASP are better and with smaller deviations than those from heuristic rules and genetic algorithms with identical partitioning genes; (2) the added premature convergence bounce helps obtain better solutions with smaller deviations; and (3) the consideration of variable costs in the fitness function helps achieve better performance indicators.
    Relation: Computers & Industrial Engineering 48(1), pp.39-54
    DOI: 10.1016/j.cie.2004.07.007
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    0KbUnknown493View/Open
    A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machines.pdf428KbAdobe PDF1View/Open
    index.html0KbHTML170View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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