메뉴 건너뛰기




Volumn 251, Issue , 2013, Pages 126-135

General flowshop scheduling problem with the sequence dependent setup times: A heuristic approach

Author keywords

General flowshop scheduling problem; Heuristic; Scheduling; Sequence dependent setup times; Total weighted tardiness

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATIONAL RESULTS; FLOW SHOP SCHEDULING PROBLEM; HEURISTIC; HEURISTIC APPROACH; LOCAL SEARCH; SEQUENCE-DEPENDENT SETUP TIME; TOTAL-WEIGHTED TARDINESS;

EID: 84883259856     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2013.06.025     Document Type: Article
Times cited : (16)

References (24)
  • 2
    • 84876124890 scopus 로고    scopus 로고
    • Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem
    • S. Arabameri, and N. Salmasi Minimization of weighted earliness and tardiness for no-wait sequence-dependent setup times flowshop scheduling problem Computers and Industrial Engineering 64 4 2013 902 916
    • (2013) Computers and Industrial Engineering , vol.64 , Issue.4 , pp. 902-916
    • Arabameri, S.1    Salmasi, N.2
  • 4
    • 70349925982 scopus 로고    scopus 로고
    • A bicriteria m-machine flowshop scheduling with sequence-dependent setup times
    • T. Eren A bicriteria m-machine flowshop scheduling with sequence-dependent setup times Applied Mathematical Modelling 34 2 2010 284 293
    • (2010) Applied Mathematical Modelling , vol.34 , Issue.2 , pp. 284-293
    • Eren, T.1
  • 7
    • 0032000804 scopus 로고    scopus 로고
    • A new constructive heuristic for the flowshop scheduling problem
    • C. Koulamas A new constructive heuristic for the flowshop scheduling problem European Journal of Operational Research 105 1998 66 71
    • (1998) European Journal of Operational Research , vol.105 , pp. 66-71
    • Koulamas, C.1
  • 8
    • 80055048882 scopus 로고    scopus 로고
    • Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
    • W.-H. Kuo, C.-J. Hsu, and D.-L. Yang Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect Information Sciences 184 2012 282 297
    • (2012) Information Sciences , vol.184 , pp. 282-297
    • Kuo, W.-H.1    Hsu, C.-J.2    Yang, D.-L.3
  • 9
    • 33748522007 scopus 로고    scopus 로고
    • A performance evaluation of permutation vs. non-permutation schedules in a flowshop
    • C.J. Liao, L.M. Liao, and C.T. Tseng A performance evaluation of permutation vs. non-permutation schedules in a flowshop International Journal of Production Research 44 20 2006 4297 4309
    • (2006) International Journal of Production Research , vol.44 , Issue.20 , pp. 4297-4309
    • Liao, C.J.1    Liao, L.M.2    Tseng, C.T.3
  • 10
    • 0003657544 scopus 로고
    • A controlled search simulated annealing method for the general job-shop scheduling problem
    • The University of Texas, Austin
    • H. Matsuo, C. Suh, R. Sullivan, A controlled search simulated annealing method for the general job-shop scheduling problem, Tech. Rep. 03-04-88, Dept. of Management, The University of Texas, Austin, 1988.
    • (1988) Tech. Rep. 03-04-88, Dept. of Management
    • Matsuo, H.1    Suh, C.2    Sullivan, R.3
  • 12
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flowshop sequencing problem
    • M. Nawaz, E.E. Enscore Jr., and I. Ham A heuristic algorithm for the m-machine, n-job flowshop sequencing problem Omega 11 1983 91 95
    • (1983) Omega , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, Jr.E.E.2    Ham, I.3
  • 13
    • 79960640293 scopus 로고    scopus 로고
    • An estimation of distribution algorithm for lot-streaming flow shop problems with setup times
    • Q.-K. Pan, and R. Ruiz An estimation of distribution algorithm for lot-streaming flow shop problems with setup times Omega 40 2 2012 166 180
    • (2012) Omega , vol.40 , Issue.2 , pp. 166-180
    • Pan, Q.-K.1    Ruiz, R.2
  • 18
    • 12344285964 scopus 로고    scopus 로고
    • Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
    • R. Ruiz, C. Maroto, and J. Alcaraz Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics European Journal of Operational Research 165 2005 34 54
    • (2005) European Journal of Operational Research , vol.165 , pp. 34-54
    • Ruiz, R.1    Maroto, C.2    Alcaraz, J.3
  • 19
    • 37049022197 scopus 로고    scopus 로고
    • An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
    • R. Ruiz, and T. Stutzle An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives European Journal of Operational Research 187 2008 1143 1159
    • (2008) European Journal of Operational Research , vol.187 , pp. 1143-1159
    • Ruiz, R.1    Stutzle, T.2
  • 21
    • 79960837616 scopus 로고    scopus 로고
    • Solving a bi-objective flowshop scheduling problem by a multi-objective immune system and comparing with SPEA2+ and SPGA
    • H.A. Tahmasbi, and R. Tavakkoli-Moghaddam Solving a bi-objective flowshop scheduling problem by a multi-objective immune system and comparing with SPEA2+ and SPGA Advances in Engineering Software 42 10 2011 772 779
    • (2011) Advances in Engineering Software , vol.42 , Issue.10 , pp. 772-779
    • Tahmasbi, H.A.1    Tavakkoli-Moghaddam, R.2
  • 23
    • 33646679650 scopus 로고    scopus 로고
    • A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
    • F.T. Tseng, J.N.D. Gupta, and E.F. Stafford A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times Journal of the Operational Research Society 57 2006 541 551
    • (2006) Journal of the Operational Research Society , vol.57 , pp. 541-551
    • Tseng, F.T.1    Gupta, J.N.D.2    Stafford, E.F.3
  • 24
    • 49349104489 scopus 로고    scopus 로고
    • Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic
    • K.-C. Ying Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic International Journal of Advanced Manufacturing Technology 38 2008 348 354
    • (2008) International Journal of Advanced Manufacturing Technology , vol.38 , pp. 348-354
    • Ying, K.-C.1


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