메뉴 건너뛰기




Volumn 11, Issue 8, 2011, Pages 5270-5280

A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers

Author keywords

Chaotic optimization; Flow shop with limited buffers; Harmony search algorithm; Makespan

Indexed keywords

CHAOTIC LOCAL SEARCHES; CHAOTIC OPTIMIZATION; COMPUTATIONAL SIMULATION; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; HARMONY SEARCH; HARMONY SEARCH ALGORITHMS; HYBRID GENETIC ALGORITHMS; HYBRID PARTICLE SWARM OPTIMIZATION; LIMITED BUFFERS; LOCAL SEARCHING; MAKESPAN; PERMUTATION FLOW-SHOP SCHEDULING; SEQUENCING PROBLEMS; SOLUTION QUALITY;

EID: 80053560487     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2011.05.033     Document Type: Article
Times cited : (77)

References (37)
  • 1
    • 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 process Operation Research 44 1996 510 525 (Pubitemid 126669516)
    • (1996) Operations Research , vol.44 , Issue.3 , pp. 510-525
    • Hall, N.G.1    Sriskandarajah, C.2
  • 2
    • 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 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
  • 4
    • 0141636340 scopus 로고    scopus 로고
    • A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage
    • H.W. Thornton, and J.L. Hunsucker A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage European Journal of Operational Research 152 2004 96 114
    • (2004) European Journal of Operational Research , vol.152 , pp. 96-114
    • Thornton, H.W.1    Hunsucker, J.L.2
  • 5
    • 0001057408 scopus 로고
    • Flow shop sequencing problems with limited buffer storage
    • R. Leisten Flow shop 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
  • 6
    • 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
  • 7
    • 0032683531 scopus 로고    scopus 로고
    • Scheduling flowshops with finite buffers and sequence-dependent setup times
    • B.A. Norman Scheduling flowshops with finite buffers and sequence-dependent setup times Computers and Industrial Engineering 36 1 1996 163 177
    • (1996) Computers and Industrial Engineering , vol.36 , Issue.1 , pp. 163-177
    • Norman, B.A.1
  • 8
    • 54549127964 scopus 로고    scopus 로고
    • A two-machine permutation flow shop scheduling problem with buffers
    • C. Smutnicki A two-machine permutation flow shop scheduling problem with buffers OR Spectrum 20 1998 229 235
    • (1998) OR Spectrum , vol.20 , pp. 229-235
    • Smutnicki, C.1
  • 9
    • 0032649738 scopus 로고    scopus 로고
    • The permutation flow shop with buffers: A tabu search approach
    • E. Nowicki The permutation flow shop with buffers: a tabu search approach European Journal of Operational Research 116 1999 205 219
    • (1999) European Journal of Operational Research , vol.116 , pp. 205-219
    • Nowicki, E.1
  • 10
    • 1442305305 scopus 로고    scopus 로고
    • Flow-shops with intermediate buffers
    • P. Brucker, S. Heitmann, and J. Hurink Flow-shops with intermediate buffers OR Spectrum 25 2003 549 574
    • (2003) OR Spectrum , vol.25 , pp. 549-574
    • Brucker, P.1    Heitmann, S.2    Hurink, J.3
  • 11
    • 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 hybrid genetic algorithm for flow shop scheduling with limited buffers Computers and Operation 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
  • 12
    • 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 hybrid PSO-based algorithm for flow shop scheduling with limited buffers Computers and Operation 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
  • 13
    • 44849083459 scopus 로고    scopus 로고
    • An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
    • B. Qian, L. Wang, D.X. Huang, W.L. Wang, and X. Wang An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers Computers and operations research 36 1 2009 209 233
    • (2009) Computers and Operations Research , vol.36 , Issue.1 , pp. 209-233
    • Qian, B.1    Wang, L.2    Huang, D.X.3    Wang, W.L.4    Wang, X.5
  • 14
    • 0034974417 scopus 로고    scopus 로고
    • A new heuristic optimization algorithm: Harmony search
    • Z.W. Geem, J.H. Kim, and G.V. Loganathan A new heuristic optimization algorithm: harmony search Simulations 76 2001 60 68 (Pubitemid 32543074)
    • (2001) Simulation , vol.76 , Issue.2 , pp. 60-68
    • Geem, Z.W.1    Kim, J.H.2    Loganathan, G.V.3
  • 15
    • 20444466485 scopus 로고    scopus 로고
    • A new meta-heuristic algorithm for continuous engineering optimization: Harmony search theory and practice
    • DOI 10.1016/j.cma.2004.09.007, PII S0045782504004682
    • K.S. Lee, and Z.W. Geem A new meta-heuristic algorithm for continuous engineering optimization, harmony search theory and practice Computer Methods in Applied Mechanics and Engineering 194 2005 3902 3933 (Pubitemid 40815237)
    • (2005) Computer Methods in Applied Mechanics and Engineering , vol.194 , Issue.36-38 , pp. 3902-3933
    • Lee, K.S.1    Geem, Z.W.2
  • 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
    • 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
  • 18
    • 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
  • 19
    • 0035661395 scopus 로고    scopus 로고
    • Parameter estimation of the nonlinear Muskingum model using Harmony Search
    • J.H. Kim, Z.W. Geem, and E.S. Kim Parameter estimation of the nonlinear Muskingum model using harmony search Journal American Water Works Association 37 2001 1131 1138 (Pubitemid 34009650)
    • (2001) Journal of the American Water Resources Association , vol.37 , Issue.5 , pp. 1131-1138
    • Kim, J.H.1    Geem, Z.W.2    Kim, E.S.3
  • 20
    • 33646268618 scopus 로고    scopus 로고
    • Optimal cost design of water distribution networks using harmony search
    • Z.W. Geem Optimal cost design of water distribution networks using harmony search Engineering Optimization 38 2006 259 280
    • (2006) Engineering Optimization , vol.38 , pp. 259-280
    • Geem, Z.W.1
  • 21
    • 18444389480 scopus 로고    scopus 로고
    • Improved particle swarm optimization combined with chaos
    • DOI 10.1016/j.chaos.2004.11.095, PII S0960077905000330
    • B. Liu, L. Wang, Y.H. Jin, F. Tang, and D.X. Huang Improved particle swarm optimization combined with chaos Chaos, Solitons & Fractals 25 2005 1261 1271 (Pubitemid 40643077)
    • (2005) Chaos, Solitons and Fractals , vol.25 , Issue.5 , pp. 1261-1271
    • Liu, B.1    Wang, L.2    Jin, Y.-H.3    Tang, F.4    Huang, D.-X.5
  • 24
    • 34250686634 scopus 로고    scopus 로고
    • An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
    • DOI 10.1016/j.amc.2007.02.103, PII S0096300307002081
    • T. Xiang, X.F. Liao, and K.W. Wong An improved particle swarm optimization algorithm combined with piecewise linear chaotic map Applied Mathematics and Computation 190 2007 1637 1645 (Pubitemid 46935902)
    • (2007) Applied Mathematics and Computation , vol.190 , Issue.2 , pp. 1637-1645
    • Xiang, T.1    Liao, X.2    Wong, K.-w.3
  • 25
    • 40949088103 scopus 로고    scopus 로고
    • A quantum particle swarm optimizer with chaotic mutation operator
    • L.D.S. Coelho A quantum particle swarm optimizer with chaotic mutation operator Chaos, Solitons & Fractals 37 2008 1409 1418
    • (2008) Chaos, Solitons & Fractals , vol.37 , pp. 1409-1418
    • Coelho, L.D.S.1
  • 26
    • 67349261353 scopus 로고    scopus 로고
    • Chaos embedded particle swarm optimization algorithms
    • B. Alatas, E. Akin, and A.B. Ozer Chaos embedded particle swarm optimization algorithms Chaos, Solitons & Fractals 40 3 2009 1715 1734
    • (2009) Chaos, Solitons & Fractals , vol.40 , Issue.3 , pp. 1715-1734
    • Alatas, B.1    Akin, E.2    Ozer, A.B.3
  • 27
    • 31444446656 scopus 로고    scopus 로고
    • A new chaotic algorithm for image encryption
    • DOI 10.1016/j.chaos.2005.08.110, PII S0960077905006661
    • H. Gao, Y. Zhang, S. Liang, and D.A. Li New chaotic algorithm for image encryption Chaos, Solitons & Fractals 29 2006 393 399 (Pubitemid 43152206)
    • (2006) Chaos, Solitons and Fractals , vol.29 , Issue.2 , pp. 393-399
    • Gao, H.1    Zhang, Y.2    Liang, S.3    Li, D.4
  • 31
    • 38249025037 scopus 로고
    • Simulated annealing for permutation flow shop scheduling
    • I. Osman, and C. Potts Simulated annealing for permutation flow shop scheduling OMEGA 17 6 1989 551 557
    • (1989) OMEGA , vol.17 , Issue.6 , pp. 551-557
    • Osman, I.1    Potts, C.2
  • 32
    • 0018030638 scopus 로고
    • Ordonnancements a contraintes disjonctives
    • J. Carlier Ordonnancements a contraintes disjonctives RAIRO Recherche Operationelle 12 1978 333 351
    • (1978) RAIRO Recherche Operationelle , vol.12 , pp. 333-351
    • Carlier, J.1
  • 33
    • 0029224965 scopus 로고
    • A genetic algorithm for flowshop sequencing
    • C. Reeves A genetic algorithm for flowshop sequencing Computers and Operations Research 22 1995 5 13
    • (1995) Computers and Operations Research , vol.22 , pp. 5-13
    • Reeves, C.1
  • 34
    • 0000765086 scopus 로고
    • Some numerical experiments for an M × J flow shop and its decision-theoretical aspects
    • J. Heller Some numerical experiments for an M × J flow shop and its decision-theoretical aspects Operations Research 8 1960 178 184
    • (1960) Operations Research , vol.8 , pp. 178-184
    • Heller, J.1
  • 36
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makspan/total flow time of jobs
    • C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makspan/total flow time of jobs European Journal of Operational Research 155 2004 426 438
    • (2004) European Journal of Operational Research , vol.155 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 37
    • 58149150064 scopus 로고    scopus 로고
    • Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming
    • S. Marimuthu, S.G. Ponnambalam, and N. Jawahar Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming Journal of Material Processing Technology 209 2009 1026 1041
    • (2009) Journal of Material Processing Technology , vol.209 , pp. 1026-1041
    • Marimuthu, S.1    Ponnambalam, S.G.2    Jawahar, N.3


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