A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
學年 97
學期 1
出版（發表）日期 2009-01-01
作品名稱 A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
作品名稱（其他語言）
著者 Pei Chann Chang; Shih Hsin Chen; V. Mani
單位
出版者
著錄名稱、卷期、頁數 Applied Mathematical Modelling 33(1), p.579-596
摘要 In this paper, a hybrid genetic algorithm is developed to solve the single machine scheduling problem with the objective to minimize the weighted sum of earliness and tardiness costs. First, dominance properties of (the conditions on) the optimal schedule are developed based on the switching of two adjacent jobs i and j. These dominance properties are only necessary conditions and not sufficient conditions for any given schedule to be optimal. Therefore, these dominance properties are further embedded in the genetic algorithm and we call it genetic algorithm with dominance properties (GADP). This GADP is a hybrid genetic algorithm. The initial populations of schedules in the genetic algorithm are generated using these dominance properties. GA can further improve the performance of these initial solutions after the evolving procedures. The performances of hybrid genetic algorithm (GADP) have been compared with simple genetic algorithm (SGA) using benchmark instances. It is shown that this hybrid genetic algorithm (GADP) performs very well when compared with DP or SGA alone.
關鍵字 Single machine scheduling;Earliness/tardiness;Dominance properties;Genetic algorithm;Optimal schedule
語言 en
ISSN 0307-904X; 1872-8480
期刊性質 國內
收錄於 SCI
產學合作
通訊作者
審稿制度 是
國別 USA
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/121462 )