메뉴 건너뛰기
International Journal of Advanced Manufacturing Technology
Volumn 55, Issue 1-4, 2011, Pages 317-326
Ant colony optimization technique for the sequence-dependent flowshop scheduling problem
Author keywords

Ant colony optimization; Makespan; Permutation flowshop; Scheduling; Sequence dependent
Indexed keywords

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHMS; ANT-COLONY OPTIMIZATION; FLOW SHOP SCHEDULING PROBLEM; JOB SCHEDULING; LOCAL SEARCH; MAKESPAN; META HEURISTICS; PERMUTATION FLOW SHOPS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PRACTICAL SYSTEMS; PROBLEM INSTANCES; PRODUCTION SCHEDULING SYSTEM; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME;
EID: 79958830028     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3037-0     Document Type: Article
Times cited : (36)
References (32)
  • 1
    • 36049020243 scopus 로고    scopus 로고
    • A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods
    • DOI 10.1016/j.cie.2007.04.004, PII S0360835207000642
    • B Ekşioǧlu SD Ekşioǧlu P Jain 2008 A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods Comput Ind Eng 54 1 11 10.1016/j.cie.2007.04.004 (Pubitemid 350102748)
    • (2008) Computers and Industrial Engineering , vol.54 , Issue.1 , pp. 1-11
    • Eksioglu, B.1    Eksioglu, S.D.2    Jain, P.3
  • 2
    • 36849082395 scopus 로고    scopus 로고
    • A survey of scheduling problems with setup times or costs
    • DOI 10.1016/j.ejor.2006.06.060, PII S0377221706008174
    • A Allahverdi CT Ng TCE Cheng MY Kovalyov 2008 A survey of scheduling problems with setup times or costs Eur J Oper Res 187 985 1032 2378326 1137.90474 10.1016/j.ejor.2006.06.060 (Pubitemid 350236619)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 985-1032
    • Allahverdi, A.1    Ng, C.T.2    Cheng, T.C.E.3    Kovalyov, M.Y.4
  • 3
    • 33747373886 scopus 로고    scopus 로고
    • A bicriteria scheduling with sequence-dependent setup times
    • DOI 10.1016/j.amc.2005.11.112, PII S0096300305010453
    • T Eren TE Güner 2006 A bicriteria scheduling with sequence-dependent setup times Appl Math Comput 179 378 385 2260886 1125.90352 10.1016/j.amc.2005.11.112 (Pubitemid 44247123)
    • (2006) Applied Mathematics and Computation , vol.179 , Issue.1 , pp. 378-385
    • Eren, T.1    Guner, E.2
  • 4
    • 0000044050 scopus 로고
    • Flowshop schedules with sequence dependent setup times
    • 0625.90042
    • JND Gupta 1986 Flowshop schedules with sequence dependent setup times J Oper Res Soc Jpn 29 3 206 219 0625.90042
    • (1986) J Oper Res Soc Jpn , vol.29 , Issue.3 , pp. 206-219
    • Gupta, J.N.D.1
  • 5
    • 0022677934 scopus 로고
    • The two-machine sequence dependent flowshop scheduling problem
    • DOI 10.1016/0377-2217(86)90037-8
    • JND Gupta WP Darrow 1986 The two-machine sequence dependent flowshop scheduling problem Eur J Oper Res 24 3 439 446 830535 0601.90075 10.1016/0377-2217(86)90037-8 (Pubitemid 16502445)
    • (1986) European Journal of Operational Research , vol.24 , Issue.3 , pp. 439-446
    • Gupta Jatinder, N.D.1    Darrow William, P.2
  • 6
    • 12344285964 scopus 로고    scopus 로고
    • Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
    • DOI 10.1016/j.ejor.2004.01.022, PII S0377221704000529
    • R Ruiz C Maroto J Alcaraz 2005 Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics Eur J Oper Res 165 34 54 2121952 1112.90338 10.1016/j.ejor.2004.01.022 (Pubitemid 40135592)
    • (2005) European Journal of Operational Research , vol.165 , Issue.1 , pp. 34-54
    • Ruiz, R.1    Maroto, C.2    Alcaraz, J.3
  • 7
    • 33748423575 scopus 로고    scopus 로고
    • Algorithms for single machine total tardiness scheduling with sequence dependent setups
    • DOI 10.1016/j.ejor.2005.05.018, PII S0377221705005060
    • SR Gupta JS Smith 2006 Algorithms for single machine total tardiness scheduling with sequence dependent setups Eur J Oper Res 175 722 739 1142.90399 10.1016/j.ejor.2005.05.018 (Pubitemid 44345073)
    • (2006) European Journal of Operational Research , vol.175 , Issue.2 , pp. 722-739
    • Gupta, S.R.1    Smith, J.S.2
  • 8
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • 10.1002/nav.3800010110
    • SM Johnson 1954 Optimal two- and three-stage production schedules with setup times included Nav Res Logist Q 1 61 68 10.1002/nav.3800010110
    • (1954) Nav Res Logist Q , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 9
    • 0016952078 scopus 로고
    • The complexity of flowshop and jobshop scheduling
    • 418895 0396.90041 10.1287/moor.1.2.117
    • MR Garey DS Johnson R Sethi 1976 The complexity of flowshop and jobshop scheduling Math Oper Res 1 2 117 129 418895 0396.90041 10.1287/moor.1.2.117
    • (1976) Math Oper Res , vol.1 , Issue.2 , pp. 117-129
    • Garey, M.R.1    Johnson, D.S.2    Sethi, R.3
  • 10
    • 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 EE Enscore Jr I Ham 1983 A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA Int J Manag Sci 11 1 91 95 (Pubitemid 13193807)
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 11
    • 0029224965 scopus 로고
    • A genetic algorithm for flowshop sequencing
    • 0815.90097 10.1016/0305-0548(93)E0014-K
    • CR Reeves 1995 A genetic algorithm for flowshop sequencing Comput Oper Res 22 1 5 13 0815.90097 10.1016/0305-0548(93)E0014-K
    • (1995) Comput Oper Res , vol.22 , Issue.1 , pp. 5-13
    • Reeves, C.R.1
  • 12
    • 33646679650 scopus 로고    scopus 로고
    • A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times
    • 10.1057/palgrave.jors.2602020
    • FT Tseng JND Gupta EF Stafford 2005 A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times J Oper Res Soc 57 541 551 10.1057/palgrave.jors.2602020
    • (2005) J Oper Res Soc , vol.57 , pp. 541-551
    • Tseng, F.T.1    Gupta, J.N.D.2    Stafford, E.F.3
  • 13
    • 37049022197 scopus 로고    scopus 로고
    • An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
    • DOI 10.1016/j.ejor.2006.07.029, PII S0377221706008277
    • R Ruiz T Stutzle 2008 An iterated greedy heuristic for the sequence dependent setup times flowshop with makespan and weighted tardiness objectives Eur J Oper Res 187 1143 1159 1137.90514 10.1016/j.ejor.2006.07.029 (Pubitemid 350245722)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1143-1159
    • Ruiz, R.1    Stutzle, T.2
  • 14
    • 0022806444 scopus 로고
    • A MILP model for the n-job M-stage flowshop with sequence dependent set-up times
    • BN Srikar S Ghosh 1986 A MILP model for the n-job M-stage flowshop with sequence dependent set-up times Int J Prod Res 24 6 1459 1474 10.1080/00207548608919815 (Pubitemid 17481862)
    • (1986) International Journal of Production Research , vol.24 , Issue.6 , pp. 1459-1474
    • Srikar Bellur, N.1    Ghosh Soumen2
  • 15
    • 27844432869 scopus 로고
    • On the Srikar-Ghosh MILP model for the N×M SDST flowshop problem
    • 10.1080/00207549008942836
    • EE Stafford Jr FT Tseng 1990 On the Srikar-Ghosh MILP model for the N×M SDST flowshop problem Int J Prod Res 28 10 1817 1830 10.1080/00207549008942836
    • (1990) Int J Prod Res , vol.28 , Issue.10 , pp. 1817-1830
    • Stafford Jr., E.E.1    Tseng, F.T.2
  • 16
    • 0032068389 scopus 로고    scopus 로고
    • Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
    • 1040.90569 10.1016/S0305-0548(97)00079-8
    • RZ Ríos-Mercado JF Bard 1998 Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups Comput Oper Res 25 5 351 366 1040.90569 10.1016/S0305-0548(97)00079-8
    • (1998) Comput Oper Res , vol.25 , Issue.5 , pp. 351-366
    • Ríos-Mercado, R.Z.1    Bard, J.F.2
  • 17
    • 0035918741 scopus 로고    scopus 로고
    • Two MILP models for the N × M SDST flowshop sequencing problem
    • DOI 10.1080/00207540010029433
    • FT Tseng EE Stafford Jr 2001 Two MILP models for the N×M SDST flowshop sequencing problem Int J Prod Res 39 8 1777 1809 1009.90042 10.1080/00207540010029433 (Pubitemid 35165619)
    • (2001) International Journal of Production Research , vol.39 , Issue.8 , pp. 1777-1809
    • Tseng, F.T.1    Stafford Jr., E.F.2
  • 18
    • 0037120684 scopus 로고    scopus 로고
    • Two models for a family of flowshop sequencing problems
    • DOI 10.1016/S0377-2217(01)00320-4, PII S0377221701003204
    • EF Stafford FT Tseng 2002 Two models for a family of flowshop sequencing problems Eur J Oper Res 142 282 293 1922583 1082.90530 10.1016/S0377-2217(01) 00320-4 (Pubitemid 34803134)
    • (2002) European Journal of Operational Research , vol.142 , Issue.2 , pp. 282-293
    • Stafford Jr., E.F.1    Tseng, F.T.2
  • 19
    • 0345306659 scopus 로고    scopus 로고
    • The flow shop scheduling polyhedron with setup times
    • 2024888 1053.90045 10.1023/A:1027372722187
    • RZ Ríos-Mercado JF Bard 2003 The flow shop scheduling polyhedron with setup times J Comb Optim 7 291 318 2024888 1053.90045 10.1023/A: 1027372722187
    • (2003) J Comb Optim , vol.7 , pp. 291-318
    • Ríos-Mercado, R.Z.1    Bard, J.F.2
  • 20
    • 0032683531 scopus 로고    scopus 로고
    • Scheduling flowshops with finite buffers and sequence-dependent setup times
    • 10.1016/S0360-8352(99)00007-8
    • BA Norman 1999 Scheduling flowshops with finite buffers and sequence-dependent setup times Comput Ind Eng 36 163 177 10.1016/S0360-8352(99) 00007-8
    • (1999) Comput Ind Eng , vol.36 , pp. 163-177
    • Norman, B.A.1
  • 21
    • 0033359123 scopus 로고    scopus 로고
    • Branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times
    • DOI 10.1023/A:1007650011043
    • RZ Ríos-Mercado JF Bard 1999 A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times IIE Trans 31 721 731 (Pubitemid 30499396)
    • (1999) IIE Transactions (Institute of Industrial Engineers) , vol.31 , Issue.8 , pp. 721-731
    • Rios-Mercado, R.Z.1    Bard, J.F.2
  • 22
    • 0344672464 scopus 로고    scopus 로고
    • An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times
    • 0948.90071 10.1023/A:1009691028143
    • RZ Ríos-Mercado JF Bard 1999 An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times J of Heuris 5 53 70 0948.90071 10.1023/A:1009691028143
    • (1999) J of Heuris , vol.5 , pp. 53-70
    • Ríos-Mercado, R.Z.1    Bard, J.F.2
  • 23
    • 0035296736 scopus 로고    scopus 로고
    • Scheduling problem in a two machine flow line with the N-step prior-job-dependent set-up times
    • 1961314 1006.90046 10.1080/002077201300029764
    • JU Sun H Hwang 2001 Scheduling problem in a two machine flow line with the N-step prior-job-dependent set-up times Int J Syst Sci 32 375 385 1961314 1006.90046 10.1080/002077201300029764
    • (2001) Int J Syst Sci , vol.32 , pp. 375-385
    • Sun, J.U.1    Hwang, H.2
  • 24
    • 28944454561 scopus 로고    scopus 로고
    • Ant colony optimization: Introduction and recent trends
    • DOI 10.1016/j.plrev.2005.10.001, PII S1571064505000333
    • C Blum 2005 Ant colony optimization: introduction and recent trends Phys Life Rev 2 353 373 10.1016/j.plrev.2005.10.001 (Pubitemid 41781478)
    • (2005) Physics of Life Reviews , vol.2 , Issue.4 , pp. 353-373
    • Blum, C.1
  • 25
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • 10.1162/106454699568728
    • M Dorigo G Di Caro LM Gambardella 1999 Ant algorithms for discrete optimization Artif Life 5 2 137 172 10.1162/106454699568728
    • (1999) Artif Life , vol.5 , Issue.2 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, L.M.3
  • 27
    • 84974691270 scopus 로고    scopus 로고
    • Ant algorithms for assembly line balancing
    • Dorigo M et al (eds) Springer-Verlag, Berlin
    • Bautista J, Pereira J (2002) Ant algorithms for assembly line balancing. In: Dorigo M et al (eds) Lecture notes in computer science. Springer-Verlag, Berlin 2463:65-75
    • (2002) Lecture Notes in Computer Science , vol.2463 , pp. 65-75
    • Bautista, J.1    Pereira, J.2
  • 28
    • 0038480082 scopus 로고    scopus 로고
    • Using ant techniques to solve the assembly line balancing problem
    • 10.1080/07408170304354
    • PR McMullen P Tarasewich 2003 Using ant techniques to solve the assembly line balancing problem IIE Trans 35 605 617 10.1080/07408170304354
    • (2003) IIE Trans , vol.35 , pp. 605-617
    • McMullen, P.R.1    Tarasewich, P.2
  • 29
    • 33748559516 scopus 로고    scopus 로고
    • Ant colony optimization for disassembly sequencing with multiple objectives
    • DOI 10.1007/s00170-005-0037-6, Intelligent Disassembly in the Demanufacturing Process
    • SM McGovern SM Gupta 2006 Ant colony optimization for disassembly sequencing with multiple objectives Int J Adv Manuf Technol 30 5-6 481 496 10.1007/s00170-005-0037-6 (Pubitemid 44370984)
    • (2006) International Journal of Advanced Manufacturing Technology , vol.30 , Issue.5-6 , pp. 481-496
    • McGovern, S.M.1    Gupta, S.M.2
  • 30
    • 33845332680 scopus 로고    scopus 로고
    • An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
    • DOI 10.1016/j.cor.2005.07.020, PII S0305054805002467
    • C Liao H Juan 2007 An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups Comput Oper Res 34 1899 1909 1112.90030 10.1016/j.cor.2005.07.020 (Pubitemid 44879763)
    • (2007) Computers and Operations Research , vol.34 , Issue.7 , pp. 1899-1909
    • Liao, C.-J.1    Juan, H.-C.2
  • 31
    • 6344253119 scopus 로고    scopus 로고
    • Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time
    • 10.1016/j.cie.2004.06.006
    • SJ Shyua BMT Linb PY Yin 2004 Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time Comput Ind Eng 47 181 193 10.1016/j.cie.2004.06.006
    • (2004) Comput Ind Eng , vol.47 , pp. 181-193
    • Shyua, S.J.1    Linb, B.M.T.2    Yin, P.Y.3
  • 32
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    • 2054703 1045.90032 10.1016/S0377-2217(02)00908-6
    • C Rajendran H Ziegler 2004 Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs Eur J Oper Res 155 426 438 2054703 1045.90032 10.1016/S0377-2217(02)00908-6
    • (2004) Eur J Oper Res , vol.155 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2

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