Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering and Applications》 2001-19
Add to Favorite Get Latest Update

Optimization Study on a Class of Flow Shop Scheduling with Non-unique Jobs

Wang Ling Zheng Dazhong(Dept.of Automation,Tsinghua University,Beijing 100084)  
Flow shop scheduling with strong engineering background is proved a typical NP-complete problem,which is very hard to solve because of the correlation of lot-size and sequence when non-unique jobs exist.This paper reasonably combines the probabilistic jumping property of simulated annealing with the parallel searching structure of genetic algorithm to propose a hybrid optimization strategy dealing with a class of flow shop scheduling problem with non-unique jobs.The proposed algorithm is able not only to improve efficiency by dynamically reducing the search space,but also enhance the ability to avoid being trapped in local minimum by introducing reraise temperature technique based on elitism.Simulation results demonstrate the effectiveness and the rapidness of the strategy.
【Fund】: 国家自然科学基金项目(编号:60074012);; 973国家基础研究项目(编号:G1998020310)
【CateGory Index】: TP399
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved