메뉴 건너뛰기




Volumn 55, Issue 1-4, 2011, Pages 11-22

Metaheuristic approaches for the design of machining lines

Author keywords

Genetic algorithms; GRASP; Line design; Machining lines

Indexed keywords

GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; INDUSTRIAL PROBLEM; INVESTMENT COSTS; LINE DESIGN; MACHINE EQUIPMENT; MACHINING OPERATIONS; META-HEURISTIC APPROACH; META-HEURISTIC METHODS; OPTIMIZATION PROBLEMS;

EID: 79958864681     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3053-0     Document Type: Article
Times cited : (29)

References (22)
  • 1
    • 36849023499 scopus 로고    scopus 로고
    • Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
    • DOI 10.1016/j.ejor.2006.07.044, PII S0377221706008320
    • C Andrés C Miralles R Pastor 2008 Balancing and scheduling tasks in assembly lines with sequence-dependent setup times Eur J Oper Res 187 3 1212 1223 1137.90476 10.1016/j.ejor.2006.07.044 (Pubitemid 350236632)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1212-1223
    • Andres, C.1    Miralles, C.2    Pastor, R.3
  • 2
    • 33846998345 scopus 로고    scopus 로고
    • Stochastic U-line balancing using genetic algorithms
    • 10.1007/s00170-005-0322-4
    • A Baykasoǧlu L ÖzbakIr 2007 Stochastic U-line balancing using genetic algorithms Int J Adv Manuf Technol 32 1-2 139 147 10.1007/s00170-005- 0322-4
    • (2007) Int J Adv Manuf Technol , vol.32 , Issue.12 , pp. 139-147
    • Baykasoǧlu, A.1    Özbakir, L.2
  • 5
    • 25144474660 scopus 로고    scopus 로고
    • A special case of transfer lines balancing by graph approach
    • DOI 10.1016/j.ejor.2004.07.025, PII S0377221704004825, Balancing Assembly and Transfer Lines
    • A Dolgui N Guschinsky G Levin 2006 A special case of transfer lines balancing by graph approach Eur J Oper Res 168 3 732 746 2169607 1083.90015 10.1016/j.ejor.2004.07.025 (Pubitemid 41336589)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 732-746
    • Dolgui, A.1    Guschinsky, N.2    Levin, G.3
  • 6
    • 34848899845 scopus 로고    scopus 로고
    • Optimisation of multi-position machines and transfer lines
    • DOI 10.1016/j.ejor.2006.03.069, PII S0377221706006564
    • A Dolgui N Guschinsky G Levin JM Proth 2008 Optimisation of multi-position machines and transfer lines Eur J Oper Res 185 3 1375 1389 2361757 1178.90126 10.1016/j.ejor.2006.03.069 (Pubitemid 47498816)
    • (2008) European Journal of Operational Research , vol.185 , Issue.3 , pp. 1375-1389
    • Dolgui, A.1    Guschinsky, N.2    Levin, G.3    Proth, J.-M.4
  • 7
    • 0024640804 scopus 로고
    • A probabilistic heuristic for a computationally difficult set covering problem
    • 995962 0675.90073 10.1016/0167-6377(89)90002-3
    • T Feo M Resende 1989 A probabilistic heuristic for a computationally difficult set covering problem Oper Res Lett 8 2 67 71 995962 0675.90073 10.1016/0167-6377(89)90002-3
    • (1989) Oper Res Lett , vol.8 , Issue.2 , pp. 67-71
    • Feo, T.1    Resende, M.2
  • 8
    • 84888798224 scopus 로고    scopus 로고
    • GRASP: An annotated bibliography
    • C. Ribeiro P. Hansen (eds). Kluwer Norwell
    • Festa P, Resende M (2002) GRASP: an annotated bibliography. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer, Norwell. pp. 325-367
    • (2002) Essays and Surveys on Metaheuristics , pp. 325-367
    • Festa, P.1    Resende, M.2
  • 9
    • 0001853336 scopus 로고    scopus 로고
    • Tabu search and adaptive memory programming-advances, applications and challenges
    • R. Barr R. Helgason J. Kennington (eds). Kluwer Norwell
    • Glover F (1996) Tabu search and adaptive memory programming-advances, applications and challenges. In: Barr R, Helgason R, Kennington J (eds) Interfaces in computer science and operations research. Kluwer, Norwell. pp. 1-75
    • (1996) Interfaces in Computer Science and Operations Research , pp. 1-75
    • Glover, F.1
  • 10
    • 67651160370 scopus 로고    scopus 로고
    • Comparison of exact and heuristic methods for a transfer line balancing problem
    • 2579924 10.1016/j.ijpe.2008.11.018
    • O Guschinskaya A Dolgui 2009 Comparison of exact and heuristic methods for a transfer line balancing problem Int J Prod Econ 120 2 276 286 2579924 10.1016/j.ijpe.2008.11.018
    • (2009) Int J Prod Econ , vol.120 , Issue.2 , pp. 276-286
    • Guschinskaya, O.1    Dolgui, A.2
  • 11
    • 40849119751 scopus 로고    scopus 로고
    • A heuristic multi-start decomposition approach for optimal design of serial machining lines
    • DOI 10.1016/j.ejor.2006.03.072, PII S0377221707006650
    • O Guschinskaya A Dolgui N Guschinsky G Levin 2008 A heuristic multi-start decomposition approach for optimal design of serial machining lines Eur J Oper Res 189 3 902 913 1146.90386 10.1016/j.ejor.2006.03.072 (Pubitemid 351400585)
    • (2008) European Journal of Operational Research , vol.189 , Issue.3 , pp. 902-913
    • Guschinskaya, O.1    Dolgui, A.2    Guschinsky, N.3    Levin, G.4
  • 13
    • 0023385165 scopus 로고
    • Semi-greedy heuristics: An empirical study
    • DOI 10.1016/0167-6377(87)90021-6
    • J Hart A Shogan 1987 Semi-greedy heuristics: an empirical study Oper Res Lett 6 3 107 114 904831 0615.90082 10.1016/0167-6377(87)90021-6 (Pubitemid 17632868)
    • (1987) Operations Research Letters , vol.6 , Issue.3 , pp. 107-114
    • Hart J.Pirie1    Shogan Andrew, W.2
  • 15
    • 53749096405 scopus 로고    scopus 로고
    • A mathematical model and a genetic algorithm for two-sided assembly line balancing
    • 1157.90390 10.1016/j.cor.2007.11.003
    • Y Kim W Song J Kim 2009 A mathematical model and a genetic algorithm for two-sided assembly line balancing Comput Oper Res 36 3 853 865 1157.90390 10.1016/j.cor.2007.11.003
    • (2009) Comput Oper Res , vol.36 , Issue.3 , pp. 853-865
    • Kim, Y.1    Song, W.2    Kim, J.3
  • 16
    • 0002234950 scopus 로고    scopus 로고
    • GRASP and path relinking for 2-layer straight line crossing minimization
    • 1092.90544 10.1287/ijoc.11.1.44
    • M Laguna R Martí 1999 GRASP and path relinking for 2-layer straight line crossing minimization INFORMS J Comput 11 1 44 52 1092.90544 10.1287/ijoc.11.1.44
    • (1999) INFORMS J Comput , vol.11 , Issue.1 , pp. 44-52
    • Laguna, M.1    Martí, R.2
  • 17
    • 25144479417 scopus 로고    scopus 로고
    • A genetic algorithm for robotic assembly line balancing
    • DOI 10.1016/j.ejor.2004.07.030, PII S0377221704004874, Balancing Assembly and Transfer Lines
    • G Levitin J Rubinovitz B Shnits 2006 A genetic algorithm for robotic assembly line balancing Eur J Oper Res 168 3 811 825 2169612 1083.90018 10.1016/j.ejor.2004.07.030 (Pubitemid 41336594)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 811-825
    • Levitin, G.1    Rubinovitz, J.2    Shnits, B.3
  • 18
    • 74549129380 scopus 로고    scopus 로고
    • Heuristic procedures for solving the general assembly line balancing problem with setups
    • 10.1080/00207540802577979
    • L Martino R Pastor 2010 Heuristic procedures for solving the general assembly line balancing problem with setups Int J Prod Res 48 6 1787 1804 10.1080/00207540802577979
    • (2010) Int J Prod Res , vol.48 , Issue.6 , pp. 1787-1804
    • Martino, L.1    Pastor, R.2
  • 19
    • 33845939092 scopus 로고    scopus 로고
    • A balancing method and genetic algorithm for disassembly line balancing
    • DOI 10.1016/j.ejor.2005.03.055, PII S0377221705007307
    • S McGovern S Gupta 2007 A balancing method and genetic algorithm for disassembly line balancing Eur J Oper Res 179 3 692 708 1144.90371 10.1016/j.ejor.2005.03.055 (Pubitemid 46038584)
    • (2007) European Journal of Operational Research , vol.179 , Issue.3 , pp. 692-708
    • McGovern, S.M.1    Gupta, S.M.2
  • 20
    • 0001017536 scopus 로고    scopus 로고
    • Genetic algorithms for the operations researcher
    • C Reeves 1997 Feature article-genetic algorithms for the operations researcher INFORMS J Comput 9 3 231 250 0893.90145 10.1287/ijoc.9.3.231 (Pubitemid 127695176)
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.3 , pp. 231-250
    • Reeves, C.R.1
  • 21
    • 0002503033 scopus 로고    scopus 로고
    • Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP
    • 0941.68527 10.1016/S0166-218X(99)00171-7
    • M Resende L Pitsoulis P Pardalos 2000 Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP Discrete Appl Math 100 1-2 95 113 0941.68527 10.1016/S0166-218X(99)00171-7
    • (2000) Discrete Appl Math , vol.100 , Issue.12 , pp. 95-113
    • Resende, M.1    Pitsoulis, L.2    Pardalos, P.3
  • 22
    • 0012587086 scopus 로고    scopus 로고
    • Greedy randomized adaptive search procedures
    • F. Glover G. Kochenberger (eds). Kluwer Norwell
    • Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Norwell. pp. 219-249
    • (2003) Handbook of Metaheuristics , pp. 219-249
    • Resende, M.1    Ribeiro, C.2


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