Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Anhui Normal University(Natural Science)》 2009-01
Add to Favorite Get Latest Update

Iterative Heuristic Algorithms for No-Wait Flowshop Scheduling Problems

QI Xue-mei(College of Mathematics and Computer Science,Anhui Normal University, Wuhu 241000,China)  
In the paper,two iterative heuristic algorithms(IHA1,IHA2 for short) were proposed for total completion time minimization in no-wait flowshop scheduling problem(NWFSP).One initial solution was obtained by FL(described by Framinan and Leisten,OMEGA,2003) and the other another initial solution was obtained by WY(described by Hoon-shik Woo and Dong-soon Yim,Computers Ops Res,1998),then the two started its iterative with RZ(developed by Rajendran and Ziegler,European Journal of Operational Research,1997)-insertion,FL-insertion and pair-exchange.For evaluation,we used Taillard's benchmark program to generate a large number of random instances.The experiment results show that IHA1 and IHA2 outperform three classical heuristics RC1,RC2 and PH1(p).With the development of size of the question,the quality of the solutions are improved much better.
【Fund】: 安徽省教育厅自然科学研究项目(2006kj024A);; 安徽师范大学第三批精品课程项目
【CateGory Index】: TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 CUI Jianshuang, LI Tieke, ZHANG Wenxin Management School, University of Science and Technology Beijing, Beijing 100083, China;Hybrid flowshop scheduling model and its genetic algorithm[J];Journal of University of Science and Technology Beijing;2005-05
2 Li Yumei~(1)) Gu Yundong~(2)) Li Hongxing~(1))(1)School of Mathematical Sciences;2)School of Management Sciences: Beijing Normal University,100875,Beijing,China);TWO HEURISTIC ALGORITHMS FOR SCHEDULING PROBLEM Pm|p_j=1,intree|∑C_j[J];Journal of Beijing Normal University(Natural Science);2006-02
3 Yuan Fen~(1)) Gu Yundong~(2)) Chen Fei~(1))(1)School of Mathematics Science;2)School of Management: Beijing Normal University,100875,Beijing,China);IDENTICAL MACHINE SCHEDULING PROBLEM WITH FUZZY DUE-DATES[J];Journal of Beijing Normal University(Natural Science);2006-03
4 Sun Xiuping~(1)) Gu Yundong~(2)) Li Hongxing (1)School of Mathematical Sciences,Beijing Normal University,100875,Beijing,China;2)Department of System Science,School of Management,Beijing Normal University, 100875,Beijing,China);MINIMIZE THE MAXIMUM LATENESS WITH WEIGHTED IN A SINGLE MACHINE PROBLEM[J];Journal of Beijing Normal University(Natural Science);2006-05
5 CHENG Zhenmin1) LI Hongxing2)(1)Business College of Beijing Union University,100025,Beijing,China;2)School of Electronic and Information Engineering,Dalian University of Technology,116024,Dalian,China);AN OPTIMAL ALGORITHM FOR IDENTICAL MACHINE SCHEDULING PROBLEM WITH PREEMPTION[J];Journal of Beijing Normal University(Natural Science);2008-05
6 JIA Chun-yu (Management College,Changchun University,Changchun*"130022,China);A study of new near optimal method for one kind of 3×n water-flowing ordering problems[J];Journal of Changchun University;2004-06
7 JIA Chun-yu~1,HONG Qi~2,WANG Fu-li~3(1.Management College,Changchun University,Changchun 130022,China;2.Basic Department,Shengzhen Technological Institute of Information Job,Shengzhen 518029,China;3.Auditting Office,Changchun University,Changchun 130022,China);A discussion of approximate optimal solution to another two kinds of 3×n permutation schedule problems[J];Journal of Changchun University;2005-01
8 JIA Chun-yu~1,HONG Qi~2,WANG Fu-li~3(1.Management College,Changchun University,Changchun 130022,China;2.Fundamental Department,Shenzhen Vocational and Technological College,Shenzhen 518029,China;3.Audit Department,Changchun University,Changchun 130021,China);The study of paths number method for m×n permutation schedule problems[J];Journal of Changchun University;2005-04
9 JIA Chun-yu,ZHEN Yu-min,LIU Fu-cheng(Management College,Changchun University,Changchun,130022,China);The study of methods for maximum near optimal solution of m×n permutation schedule problems[J];Journal of Changchun University;2007-09
10 Hong Qi(Shenzhen Vocational and Technical College, Shenzhen 518029, P. R. China); Jia Chunyu(Management College of Changchun University); Sha Xinhua(Tianjin University);Simple Solution for 2×n Job-shop Problems with Preference Sequence Restraint[J];Journal of Northeast Forestry University;2006-02
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved