메뉴 건너뛰기




Volumn 39, Issue 11, 2012, Pages 2520-2527

Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems

Author keywords

Blocking constraints; Flowshop scheduling problem; Heuristic; Makespan; Metaheuristics

Indexed keywords

BLOCKING CONSTRAINTS; FLOW SHOP SCHEDULING PROBLEM; HEURISTIC; MAKESPAN; META HEURISTICS;

EID: 84859717538     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.12.022     Document Type: Article
Times cited : (38)

References (26)
  • 9
    • 0346009089 scopus 로고    scopus 로고
    • Improved genetic algorithm for the permutation flow-shop scheduling problem
    • S.K. Iyer, and B. Saxena Improved genetic algorithm for the permutation flow-shop scheduling problem Computers and Operations Research 2004
    • (2004) Computers and Operations Research
    • Iyer, S.K.1    Saxena, B.2
  • 10
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1954
    • (1954) Naval Research Logistics Quarterly
    • Johnson, S.M.1
  • 14
    • 24144443448 scopus 로고    scopus 로고
    • A branch-and-bound algorithm to minimize the makespan in a flow-shop with blocking
    • D.P. Ronconi A branch-and-bound algorithm to minimize the makespan in a flow-shop with blocking Annals of Operations Research 2005
    • (2005) Annals of Operations Research
    • Ronconi, D.P.1
  • 16
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 2007
    • (2007) European Journal of Operational Research
    • Ruiz, R.1    Stützle, T.2
  • 18
    • 84865225750 scopus 로고    scopus 로고
    • A genetic algorithm with genes-association recognition for flowshop scheduling problems
    • Sauvey, C. and N. Sauer, (2010). A genetic algorithm with genes-association recognition for flowshop scheduling problems, Journal of Intelligent Manufacturing.
    • (2010) Journal of Intelligent Manufacturing
    • Sauvey, C.1    Sauer, N.2
  • 19
    • 0027615366 scopus 로고
    • A schedule algorithm for flexible flow lines with limited intermediate buffers
    • T.J. Sawik A schedule algorithm for flexible flow lines with limited intermediate buffers Applied Stochastic Models and Data Analysis 1993
    • (1993) Applied Stochastic Models and Data Analysis
    • Sawik, T.J.1
  • 23
    • 84859704971 scopus 로고    scopus 로고
    • Application of em algorithm to flow-shop scheduling problems with a special blocking
    • Yuan, K, Sauer N. Application of EM algorithm to flow-shop scheduling problems with a special blocking. In: Proceedings of the ISEM; 2007.
    • (2007) Proceedings of the ISEM
    • Yuan, K.1    Sauer, N.2
  • 25
    • 54449086192 scopus 로고    scopus 로고
    • Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
    • G.I. Zobolas, C.D. Tarantilis, and G. Ioannou Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm Computers and Operations Research 2009
    • (2009) Computers and Operations Research
    • Zobolas, G.I.1    Tarantilis, C.D.2    Ioannou, G.3
  • 26
    • 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. Zheng An effective hybrid genetic algorithm for flow shop scheduling with limited buffers Computers and Operations Research 33 10 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가 분석하여 추출한 것입니다.