메뉴 건너뛰기




Volumn 61, Issue 1, 2011, Pages 76-83

A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem

Author keywords

Blocking flow shop; Harmony search; Metaheuristics; NEH heuristic; Tabu Search

Indexed keywords

ADJUSTMENT RULES; BLOCKING FLOW; COMPUTATIONAL SIMULATION; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; INSERT NEIGHBORHOOD; LOCAL SEARCH ALGORITHM; MAKESPAN CRITERION; META HEURISTICS; NEH HEURISTIC; PERMUTATION FLOW-SHOP SCHEDULING; POSITION VALUE; SOLUTION QUALITY;

EID: 79955911845     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.02.013     Document Type: Article
Times cited : (151)

References (29)
  • 5
    • 0034359873 scopus 로고    scopus 로고
    • A permutation flow-shop scheduling problem with convex models of operation processing times
    • T.C.E. Cheng, and A. Janiak A permutation flow-shop scheduling problem with convex models of operation processing times Annals of Operations Research 96 2000 39 60
    • (2000) Annals of Operations Research , vol.96 , pp. 39-60
    • Cheng, T.C.E.1    Janiak, A.2
  • 8
    • 0037971131 scopus 로고    scopus 로고
    • An efficient constructive heuristic for flowtime minimisation in permutation flow shops
    • DOI 10.1016/S0305-0483(03)00047-1, PII S0305048303000471
    • J.M. Framinan, and R. Leisten An effective constructive heuristic for flowtime minimisation in permutation flow shops OMEGA 31 2003 311 317 (Pubitemid 36742549)
    • (2003) Omega , vol.31 , Issue.4 , pp. 311-317
    • Framinan, J.M.1    Leisten, R.2
  • 9
    • 0037578177 scopus 로고    scopus 로고
    • Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
    • J.M. Framinan, R. Leisten, and C. Rajendran Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem International Journal of Production Research 41 2003 121 148
    • (2003) International Journal of Production Research , vol.41 , pp. 121-148
    • Framinan, J.M.1    Leisten, R.2    Rajendran, C.3
  • 11
    • 33748279816 scopus 로고    scopus 로고
    • The permutation flow shop problem with blocking. A tabu search approach
    • DOI 10.1016/j.omega.2005.07.004, PII S0305048305000915
    • J. Grabowski, and J. Pempera The permutation flow shop problem with blocking. A tabu search approach OMEGA 35 2007 302 311 (Pubitemid 44317633)
    • (2007) Omega , vol.35 , Issue.3 , pp. 302-311
    • Grabowski, J.1    Pempera, J.2
  • 12
    • 0030134958 scopus 로고    scopus 로고
    • A survey of machine scheduling problems with blocking and no-wait in process
    • N.G. Hall, and C. Sriskandarajah A survey of machine scheduling problems with blocking and no-wait in process Operations Research 44 1996 510 525 (Pubitemid 126669516)
    • (1996) Operations Research , vol.44 , Issue.3 , pp. 510-525
    • Hall, N.G.1    Sriskandarajah, C.2
  • 13
    • 27844531167 scopus 로고    scopus 로고
    • The harmony search heuristic algorithm for discrete structural optimization
    • DOI 10.1080/03052150500211895
    • K.S. Lee, Z.W. Geem, S.-H. Lee, and K.-W. Bae The harmony search heuristic algorithm for discrete structural optimization Engineering Optimization 37 2005 663 684 (Pubitemid 41659247)
    • (2005) Engineering Optimization , vol.37 , Issue.7 , pp. 663-684
    • Lee, K.S.1    Geem, Z.W.2    Lee, S.-H.O.3    Bae, K.-W.4
  • 14
    • 0001057408 scopus 로고
    • Flowshop sequencing problems with limited buffer storage
    • R. Leisten Flowshop sequencing problems with limited buffer storage International Journal of Production Research 28 1990 2085 2100
    • (1990) International Journal of Production Research , vol.28 , pp. 2085-2100
    • Leisten, R.1
  • 15
    • 38749118677 scopus 로고    scopus 로고
    • An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
    • DOI 10.1016/j.cor.2006.12.013, PII S0305054806003169
    • B. Liu, L. Wang, and Y.H. Jin An effective PSO-based algorithm for flow shop scheduling with limited buffers Computers & Operations Research 35 2008 2791 2806 (Pubitemid 351186803)
    • (2008) Computers and Operations Research , vol.35 , Issue.9 , pp. 2791-2806
    • Liu, B.1    Wang, L.2    Jin, Y.-H.3
  • 16
    • 34248141625 scopus 로고    scopus 로고
    • An improved harmony search algorithm for solving optimization problems
    • DOI 10.1016/j.amc.2006.11.033, PII S0096300306015098
    • M. Mahdavi, M. Fesanghary, and E. Damangir An improved harmony search algorithm for solving optimization problems Applied Mathematics and Computation 188 2007 1567 1579 (Pubitemid 46710046)
    • (2007) Applied Mathematics and Computation , vol.188 , Issue.2 , pp. 1567-1579
    • Mahdavi, M.1    Fesanghary, M.2    Damangir, E.3
  • 17
    • 0024770469 scopus 로고
    • Sequencing in an assembly line with blocking to minimize cycle time
    • S.T. McCormich, M.L. Pinedo, S. Shenker, and B. Wolf Sequencing in an assembly line with blocking to minimize cycle time Operations Research 37 1989 925 936
    • (1989) Operations Research , vol.37 , pp. 925-936
    • McCormich, S.T.1    Pinedo, M.L.2    Shenker, S.3    Wolf, B.4
  • 18
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • DOI 10.1016/0305-0483(83)90088-9
    • M. Nawaz, E.E.J. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow shop sequencing problem OMEGA - International Journal of Management Science 11 1983 91 95 (Pubitemid 13193807)
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 19
    • 40849115183 scopus 로고    scopus 로고
    • Global-best harmony search
    • DOI 10.1016/j.amc.2007.09.004, PII S0096300307009320
    • M.G.H. Omran, and M. Mahdavi Global-best harmony search Applied Mathematics and Computation 198 2008 643 656 (Pubitemid 351400737)
    • (2008) Applied Mathematics and Computation , vol.198 , Issue.2 , pp. 643-656
    • Omran, M.G.H.1    Mahdavi, M.2
  • 21
    • 77957106725 scopus 로고    scopus 로고
    • An iterated greedy algorithm for the flowshop scheduling problem with blocking
    • I. Ribas, R. Companys, and X. Tort-Martorell An iterated greedy algorithm for the flowshop scheduling problem with blocking OMEGA 39 2011 293 301
    • (2011) OMEGA , vol.39 , pp. 293-301
    • Ribas, I.1    Companys, R.2    Tort-Martorell, X.3
  • 22
    • 0242578576 scopus 로고    scopus 로고
    • A note on constructive heuristics for the flowshop problem with blocking
    • D.P. Ronconi A note on constructive heuristics for the flowshop problem with blocking International Journal of Production Economics 87 2004 39 48
    • (2004) International Journal of Production Economics , vol.87 , pp. 39-48
    • Ronconi, D.P.1
  • 23
    • 24144443448 scopus 로고    scopus 로고
    • A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
    • DOI 10.1007/s10479-005-2444-3
    • D.P. Ronconi A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking Annals of Operations Research 138 1 2005 53 65 (Pubitemid 41241790)
    • (2005) Annals of Operations Research , vol.138 , Issue.1 , pp. 53-65
    • Ronconi, D.P.1
  • 24
    • 0035506517 scopus 로고    scopus 로고
    • Lower bounding schemes for flowshops with blocking in-process
    • D.P. Ronconi, and V.A. Armentano Lower bounding schemes for flowshops with blocking in-process Journal of the Operational Research Society 52 2001 1289 1297 (Pubitemid 33085254)
    • (2001) Journal of the Operational Research Society , vol.52 , Issue.11 , pp. 1289-1297
    • Ronconi, D.P.1    Armentano, V.A.2
  • 25
    • 46349102933 scopus 로고    scopus 로고
    • Some heuristic algorithms for total tardiness minimization in a flowshop with blocking
    • D.P. Ronconi, and L.R.S. Henriques Some heuristic algorithms for total tardiness minimization in a flowshop with blocking OMEGA - International Journal of Management Science 37 2 2009 272 281
    • (2009) OMEGA - International Journal of Management Science , vol.37 , Issue.2 , pp. 272-281
    • Ronconi, D.P.1    Henriques, L.R.S.2
  • 26
    • 0025700701 scopus 로고
    • Some efficient heuristic methods for the flow shop sequencing problem
    • DOI 10.1016/0377-2217(90)90090-X
    • E. Taillard Some efficient heuristic methods for the flow shop sequencing problems European Journal of Operational Research 47 1990 65 74 (Pubitemid 20733430)
    • (1990) European Journal of Operational Research , vol.47 , Issue.1 , pp. 65-74
    • Taillard, E.1
  • 27
    • 0027201278 scopus 로고
    • Benchmarks for basic scheduling problems
    • DOI 10.1016/0377-2217(93)90182-M
    • E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 1993 278 285 (Pubitemid 23599340)
    • (1993) European Journal of Operational Research , vol.64 , Issue.2 , pp. 278-285
    • Taillard, E.1
  • 28
    • 26444474118 scopus 로고    scopus 로고
    • A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups
    • DOI 10.1016/j.cor.2004.09.018, PII S0305054804002412
    • X. Wang, and T.C.E. Cheng A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups Computers and Operations Research 33 2006 1326 1344 (Pubitemid 41428294)
    • (2006) Computers and Operations Research , vol.33 , Issue.5 , pp. 1326-1344
    • Wang, X.1    Cheng, T.C.E.2
  • 29
    • 32044464100 scopus 로고    scopus 로고
    • An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
    • DOI 10.1016/j.cor.2005.02.028, PII S0305054805000845, Constrain Programming
    • L. Wang, L. Zhang, and D.Z. Zheng An effective genetic algorithm for flow shop scheduling with limited buffers Computers & Operations Research 33 2006 2960 2971 (Pubitemid 43199834)
    • (2006) Computers and Operations Research , vol.33 , Issue.10 , pp. 2960-2971
    • Wang, L.1    Zhang, L.2    Zheng, D.-Z.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.