AHarmonysearchalgorithmforJSP教程.pdfVIP

Applied Soft Computing 11 (2011) 5270–5280 Contents lists available at ScienceDirect Applied Soft Computing j o u r na l h o me p a g e: w w w. elsev /l o c a te /as o c A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers Quan-Ke Pan a,b , Ling Wang c , Liang Gao a,∗ a State Key Lab. of Digital Manufacturing Equipment Technology in Huazhong University of Science Technology, Wuhan 430074, PR China b College of Computer Science, Liaocheng University, Liaocheng 252059, PR China c Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing 100084, China a r t i c l e i n f o a b s t r a c t Article history: In this paper, a chaotic harmony search (CHS) algorithm is proposed to minimize makespan for the per- Received 29 May 2009 mutation flow shop scheduling problem with limited buffers. First of all, to make the harmony search Received in revised form 7 January 2011 algorithm suitable for solving the problem under consideration, a rank-of-value rule is applied to convert Accepted 15 May 2011 continuous harmony vectors to discrete job permutations. Secondly, an efficient initialization scheme Available online 20 May 2011 based on the Nawaz–Enscore–Ham heuristic [M. Nawaz, E.E.J. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA-International Journal of Management Keywords: