메뉴 건너뛰기




Volumn 87, Issue , 2015, Pages 30-39

Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization

Author keywords

Blocking; Flow shop; Heuristics; Scheduling; Total flow time

Indexed keywords

ALGORITHMS; HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; OPTIMIZATION;

EID: 84929590179     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2015.04.013     Document Type: Article
Times cited : (57)

References (28)
  • 1
    • 84874633560 scopus 로고    scopus 로고
    • Scheduling flow shops with blocking using discrete self-organising migration algorithm
    • D. Davendra, and M. Bialic-Davendra Scheduling flow shops with blocking using discrete self-organising migration algorithm International Journal of Production Research 51 8 2013 2200 2218
    • (2013) International Journal of Production Research , vol.51 , Issue.8 , pp. 2200-2218
    • Davendra, D.1    Bialic-Davendra, M.2
  • 2
    • 84872039347 scopus 로고    scopus 로고
    • A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling
    • G. Deng, Z. Xu, and X. Gu A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling Chinese Journal of Chemical Engineering 20 6 2012 1067 1073
    • (2012) Chinese Journal of Chemical Engineering , vol.20 , Issue.6 , pp. 1067-1073
    • Deng, G.1    Xu, Z.2    Gu, X.3
  • 3
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • T.A. Feo, and M.G.C. Resende A probabilistic heuristic for a computationally difficult set covering problem Operatons Research Letters 8 1989 67 71
    • (1989) Operatons Research Letters , vol.8 , pp. 67-71
    • Feo, T.A.1    Resende, M.G.C.2
  • 4
    • 7544243412 scopus 로고    scopus 로고
    • Comparison of heuristics for flowtime minimisation in permutation flowshops
    • J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimisation in permutation flowshops Computers & Operations Research 32 5 2005 1237 1254
    • (2005) Computers & Operations Research , vol.32 , Issue.5 , pp. 1237-1254
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 5
    • 70350619908 scopus 로고    scopus 로고
    • A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
    • H. Gong, L. Tang, and C.W. Duin A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times Computers & Operations Research 37 5 2010 960 969
    • (2010) Computers & Operations Research , vol.37 , Issue.5 , pp. 960-969
    • Gong, H.1    Tang, L.2    Duin, C.W.3
  • 7
    • 33748279816 scopus 로고    scopus 로고
    • The permutation flow shop problem with blocking. A tabu search approach
    • J. Grabowski, and J. Pempera The permutation flow shop problem with blocking. A tabu search approach Omega 35 3 2007 302 311
    • (2007) Omega , vol.35 , Issue.3 , pp. 302-311
    • Grabowski, J.1    Pempera, J.2
  • 10
    • 0035898985 scopus 로고    scopus 로고
    • Constructive and composite heuristic solutions to the P//ΣCi scheduling problem
    • J. Liu, and C.R. Reeves Constructive and composite heuristic solutions to the P//ΣCi scheduling problem Data Envelopment Analysis 132 2 2001 439 452
    • (2001) Data Envelopment Analysis , vol.132 , Issue.2 , pp. 439-452
    • Liu, J.1    Reeves, C.R.2
  • 11
    • 38749118677 scopus 로고    scopus 로고
    • An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
    • B. Liu, L. Wang, and Y. Jin An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers Computers & Operations Research 35 9 2008 2791 2806
    • (2008) Computers & Operations Research , vol.35 , Issue.9 , pp. 2791-2806
    • Liu, B.1    Wang, L.2    Jin, Y.3
  • 13
    • 0024770469 scopus 로고
    • Sequencing in an assembly line with blocking to minimize cycle time
    • S.T. McCormick, 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
    • McCormick, S.T.1    Pinedo, M.L.2    Shenker, S.3    Wolf, B.4
  • 14
    • 84875936857 scopus 로고    scopus 로고
    • Optimizing blocking flow shop scheduling problem with total completion time criterion
    • G. Moslehi, and D. Khorasanian Optimizing blocking flow shop scheduling problem with total completion time criterion Computers & Operations Research 40 7 2013 1874 1883
    • (2013) Computers & Operations Research , vol.40 , Issue.7 , pp. 1874-1883
    • Moslehi, G.1    Khorasanian, D.2
  • 15
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 1 1983 91 95
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore, E.E.2    Ham, I.3
  • 16
    • 84861810499 scopus 로고    scopus 로고
    • Local search methods for the flowshop scheduling problem with flowtime minimization
    • Q. Pan, and R. Ruiz Local search methods for the flowshop scheduling problem with flowtime minimization European Journal of Operational Research 222 1 2012 31 43
    • (2012) European Journal of Operational Research , vol.222 , Issue.1 , pp. 31-43
    • Pan, Q.1    Ruiz, R.2
  • 17
    • 84866148007 scopus 로고    scopus 로고
    • A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
    • Q.-K. Pan, and R. Ruiz A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime Computers & Operations Research 40 1 2013 117 128
    • (2013) Computers & Operations Research , vol.40 , Issue.1 , pp. 117-128
    • Pan, Q.-K.1    Ruiz, R.2
  • 18
    • 56349108521 scopus 로고    scopus 로고
    • An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
    • B. Qian, L. Wang, D.X. Huang, and X. Wang An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers International Journal of Production Research 47 1 2009 1 24
    • (2009) International Journal of Production Research , vol.47 , Issue.1 , pp. 1-24
    • Qian, B.1    Wang, L.2    Huang, D.X.3    Wang, X.4
  • 19
    • 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. Wang, and X. Wang An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers Computers & Operations Research 36 1 2009 209 233
    • (2009) Computers & Operations Research , vol.36 , Issue.1 , pp. 209-233
    • Qian, B.1    Wang, L.2    Huang, D.X.3    Wang, W.4    Wang, X.5
  • 20
    • 0027542699 scopus 로고
    • Heuristic algorithm for scheduling in a flowshop to minimize total flowtime
    • C. Rajendran Heuristic algorithm for scheduling in a flowshop to minimize total flowtime International Journal of Production Economics 29 1 1993 65 73
    • (1993) International Journal of Production Economics , vol.29 , Issue.1 , pp. 65-73
    • Rajendran, C.1
  • 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 3 2011 293 301
    • (2011) Omega , vol.39 , Issue.3 , pp. 293-301
    • Ribas, I.1    Companys, R.2    Tort-Martorell, X.3
  • 22
    • 84891367893 scopus 로고    scopus 로고
    • A competitive variable neighbourhood search algorithm for the blocking flowshop problem
    • I. Ribas, R. Companys, and X. Tort-Martorell A competitive variable neighbourhood search algorithm for the blocking flowshop problem European Journal of Industrial Engineering 7 6 2013 729 754
    • (2013) European Journal of Industrial Engineering , vol.7 , Issue.6 , pp. 729-754
    • Ribas, I.1    Companys, R.2    Tort-Martorell, X.3
  • 23
    • 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 1 2004 39 48
    • (2004) International Journal of Production Economics , vol.87 , Issue.1 , pp. 39-48
    • Ronconi, D.P.1
  • 26
    • 77957844759 scopus 로고    scopus 로고
    • Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms
    • L. Wang, Q. Pan, and M. Fatih Tasgetiren Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms Expert Systems with Applications 37 12 2010 7929 7936
    • (2010) Expert Systems with Applications , vol.37 , Issue.12 , pp. 7929-7936
    • Wang, L.1    Pan, Q.2    Fatih Tasgetiren, M.3
  • 27
    • 70349273953 scopus 로고    scopus 로고
    • A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
    • L. Wang, Q. Pan, P.N. Suganthan, W. Wang, and Y. Wang A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems Computers & Operations Research 37 3 2010 509 520
    • (2010) Computers & Operations Research , vol.37 , Issue.3 , pp. 509-520
    • Wang, L.1    Pan, Q.2    Suganthan, P.N.3    Wang, W.4    Wang, Y.5
  • 28
    • 32044464100 scopus 로고    scopus 로고
    • An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
    • L. Wang, L. Zhang, and D. Zheng An effective hybrid genetic algorithm for flow shop scheduling with limited buffers Computers & Operations Research 33 10 2006 2960 2971
    • (2006) Computers & Operations Research , vol.33 , Issue.10 , pp. 2960-2971
    • Wang, L.1    Zhang, L.2    Zheng, D.3


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