메뉴 건너뛰기




Volumn 55, Issue 5-8, 2011, Pages 741-753

A GRASP heuristic for the multi-objective permutation flowshop scheduling problem

Author keywords

Flowshop scheduling; GRASP; Heuristics; Multi objective combinatorial optimization

Indexed keywords

BASIC CONCEPTS; BRANCH-AND-BOUND ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; FLOW-SHOP SCHEDULING; GRASP; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; HEURISTICS; MAKESPAN; MAXIMUM TARDINESS; METAHEURISTIC; MULTI OBJECTIVE; MULTI-OBJECTIVE COMBINATORIAL OPTIMIZATION; MULTI-OBJECTIVE GENETIC ALGORITHM; MULTI-OBJECTIVE PROBLEM; NONDOMINATED SOLUTIONS; PARETO DOMINANCE; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SCALARIZING FUNCTION; TOTAL FLOWTIME; TWO MACHINES;

EID: 79958849989     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-010-3100-x     Document Type: Article
Times cited : (35)

References (62)
  • 1
    • 13444254192 scopus 로고    scopus 로고
    • A bi-objective model for robust resource-constrained project scheduling
    • DOI 10.1016/j.ijpe.2004.04.002, PII S0925527304001458
    • MA Al-Fawzana M Haouari 2005 A bi-objective model for robust resource-constrained project scheduling Int J Prod Econ 96 175 187 10.1016/j.ijpe.2004.04.002 (Pubitemid 40200698)
    • (2005) International Journal of Production Economics , vol.96 , Issue.2 , pp. 175-187
    • Al-Fawzan, M.A.1    Haouari, M.2
  • 2
    • 6944244339 scopus 로고    scopus 로고
    • An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
    • 10.1023/B:HEUR.0000045320.79875.e3
    • VA Armentano JEC Arroyo 2004 An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem J Heuristics 5 463 481 10.1023/B:HEUR.0000045320.79875.e3
    • (2004) J Heuristics , vol.5 , pp. 463-481
    • Armentano, V.A.1    Arroyo, J.E.C.2
  • 3
    • 0033102073 scopus 로고    scopus 로고
    • Tabu search for total tardiness minimization in flowshop scheduling problems
    • DOI 10.1016/S0305-0548(98)00060-4, PII S0305054898000604
    • VA Armentano DP Ronconi 1999 Tabu search for total tardiness minimization in flowshop scheduling problems Comput Oper Res 26 219 235 1656760 0947.90040 10.1016/S0305-0548(98)00060-4 (Pubitemid 29346473)
    • (1999) Computers and Operations Research , vol.26 , Issue.3 , pp. 219-235
    • Armentano, V.A.1    Ronconi, D.P.2
  • 4
    • 4344592872 scopus 로고    scopus 로고
    • A partial enumeration heuristic for multi-objective flowshop scheduling problems
    • 1097.90519 10.1057/palgrave.jors.2601746
    • JEC Arroyo VA Armentano 2004 A partial enumeration heuristic for multi-objective flowshop scheduling problems J Oper Res Soc 55 1000 1007 1097.90519 10.1057/palgrave.jors.2601746
    • (2004) J Oper Res Soc , vol.55 , pp. 1000-1007
    • Arroyo, J.E.C.1    Armentano, V.A.2
  • 5
    • 13544262325 scopus 로고    scopus 로고
    • Genetic local search for multi-objective flowshop scheduling problems
    • DOI 10.1016/j.ejor.2004.07.017, PII S0377221704004746, Multicriteria Scheduling
    • JEC Arroyo VA Armentano 2005 Genetic local search for multi-objective flowshop scheduling problems Eur J Oper Res 167 717 738 2157067 1077.90023 10.1016/j.ejor.2004.07.017 (Pubitemid 40220087)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 717-738
    • Arroyo, J.E.C.1    Armentano, V.A.2
  • 6
    • 38749083109 scopus 로고    scopus 로고
    • A GRASP algorithm for the multi-criteria minimum spanning tree problem
    • 2388356 1155.90446 10.1007/s10479-007-0263-4
    • JEC Arroyo OS Vieira DS Vianna 2008 A GRASP algorithm for the multi-criteria minimum spanning tree problem Ann Oper Res 159 125 133 2388356 1155.90446 10.1007/s10479-007-0263-4
    • (2008) Ann Oper Res , vol.159 , pp. 125-133
    • Arroyo, J.E.C.1    Vieira, O.S.2    Vianna, D.S.3
  • 7
    • 72449191364 scopus 로고    scopus 로고
    • Implementation of scatter search for multi objective optimization: A comparative study
    • 1211.90202 10.1007/s10589-007-9121-1
    • R Baños C Gil J Reca J Martínez 2009 Implementation of scatter search for multi objective optimization: a comparative study J Comp Opt Applications 42 3 421 441 1211.90202 10.1007/s10589-007-9121-1
    • (2009) J Comp Opt Applications , vol.42 , Issue.3 , pp. 421-441
    • Baños, R.1    Gil, C.2    Reca, J.3    Martínez, J.4
  • 8
    • 0028467474 scopus 로고
    • An interactive procedure for bi-criteria production scheduling
    • 0810.90052 10.1016/0305-0548(94)90082-5
    • JJ Bernardo K-S Lin 1994 An interactive procedure for bi-criteria production scheduling Comput Oper Res 21 677 688 0810.90052 10.1016/0305- 0548(94)90082-5
    • (1994) Comput Oper Res , vol.21 , pp. 677-688
    • Bernardo, J.J.1    Lin, K.-S.2
  • 9
    • 85133775397 scopus 로고    scopus 로고
    • A comprehensive survey of evolutionary-based multiobjective optimization
    • CAC Coello 1999 A comprehensive survey of evolutionary-based multiobjective optimization Knowl Inf Syst 1 3 269 308
    • (1999) Knowl Inf Syst , vol.1 , Issue.3 , pp. 269-308
    • Coello, C.A.C.1
  • 10
    • 85018104842 scopus 로고    scopus 로고
    • Pareto Simulated Annealing - A Metaheuristic Technique for Multiple-Objective Combinatorial Optimization
    • DOI 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6
    • P Czyzak A Jaskiewicz 1998 Pareto simulated annealing-a metaheuristic technique for multiple objective combinatorial optimization J Multi-Criteria Decis Making 7 34 47 0904.90146 10.1002/(SICI)1099-1360(199801)7:1<34::AID- MCDA161>3.0.CO;2-6 (Pubitemid 128016907)
    • (1998) Journal of multi-criteria decision analysis , vol.7 , Issue.1 , pp. 34-47
    • Czyzak, P.1    Jaszkiewicz, A.2
  • 11
    • 0025539911 scopus 로고
    • Multiobjective flow-shop scheduling
    • RL Daniels RJ Chambers 1990 Multiobjective flow-shop scheduling Naval Res Logist 37 981 995 0825.90551 10.1002/1520-6750(199012)37:6<981::AID- NAV3220370617>3.0.CO;2-H (Pubitemid 21663943)
    • (1990) Naval Research Logistics , vol.37 , Issue.6 , pp. 981-995
    • Daniels, R.L.1    Chambers, R.J.2
  • 12
    • 69649083513 scopus 로고    scopus 로고
    • Solving multi-objective SDST flexible flow shop using GRASP algorithm
    • 10.1007/s00170-008-1887-5
    • H Davoudpour M Ashrafi 2009 Solving multi-objective SDST flexible flow shop using GRASP algorithm Int J Adv Manuf Technol 44 737 747 10.1007/s00170-008-1887-5
    • (2009) Int J Adv Manuf Technol , vol.44 , pp. 737-747
    • Davoudpour, H.1    Ashrafi, M.2
  • 14
    • 0002218558 scopus 로고
    • Bicriterion static scheduling research for a single machine
    • 10.1016/0305-0483(88)90008-4
    • P Dileepan T Sen 1988 Bicriterion static scheduling research for a single machine Omega 16 53 59 10.1016/0305-0483(88)90008-4
    • (1988) Omega , vol.16 , pp. 53-59
    • Dileepan, P.1    Sen, T.2
  • 15
    • 0000049494 scopus 로고
    • Greedy randomizes adaptive search procedures
    • 1322875 0822.90110 10.1007/BF01096763
    • T Feo MGC Resende 1995 Greedy randomizes adaptive search procedures J Glob Optim 6 109 133 1322875 0822.90110 10.1007/BF01096763
    • (1995) J Glob Optim , vol.6 , pp. 109-133
    • Feo, T.1    Resende, M.G.C.2
  • 16
    • 85040412672 scopus 로고    scopus 로고
    • An annotated bibliography of GRASP, part II: Applications
    • 2503007 1168.90582 10.1111/j.1475-3995.2009.00664.x
    • P Festa MGC Resende 2009 An annotated bibliography of GRASP, part II: applications Int Trans Oper Res 16 131 172 2503007 1168.90582 10.1111/j.1475-3995.2009.00664.x
    • (2009) Int Trans Oper Res , vol.16 , pp. 131-172
    • Festa, P.1    Resende, M.G.C.2
  • 17
    • 67651204579 scopus 로고    scopus 로고
    • A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms
    • 10.1007/s00170-008-1771-3
    • JM Framinan 2008 A fitness-based weighting mechanism for multicriteria flowshop scheduling using genetic algorithms Int J Adv Manuf Technol 43 939 948 10.1007/s00170-008-1771-3
    • (2008) Int J Adv Manuf Technol , vol.43 , pp. 939-948
    • Framinan, J.M.1
  • 18
    • 47849084195 scopus 로고    scopus 로고
    • A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
    • 2425487 1193.90099 10.1007/s00291-007-0098-z
    • JM Framinan R Leisten 2008 A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria OR Spectr 30 4 787 804 2425487 1193.90099 10.1007/s00291-007-0098-z
    • (2008) OR Spectr , vol.30 , Issue.4 , pp. 787-804
    • Framinan, J.M.1    Leisten, R.2
  • 19
    • 0037120618 scopus 로고    scopus 로고
    • Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization
    • 1081.90555 10.1016/S0377-2217(01)00278-8
    • JM Framinan R Leisten R Ruiz-Usano 2002 Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization Eur J Oper Res 141 559 569 1081.90555 10.1016/S0377-2217(01)00278-8
    • (2002) Eur J Oper Res , vol.141 , pp. 559-569
    • Framinan, J.M.1    Leisten, R.2    Ruiz-Usano, R.3
  • 20
    • 0000855797 scopus 로고
    • A framework for single machine multiple objective sequencing research
    • 10.1016/0305-0483(89)90063-7
    • TD Fry RD Armstrong H Lewis 1989 A framework for single machine multiple objective sequencing research Omega 17 595 607 10.1016/0305-0483(89)90063-7
    • (1989) Omega , vol.17 , pp. 595-607
    • Fry, T.D.1    Armstrong, R.D.2    Lewis, H.3
  • 21
    • 24344436349 scopus 로고    scopus 로고
    • 1984-2004 - 20 years of multiobjective metaheuristics. But what about the solution of combinatorial problems with multiple objectives?
    • Evolutionary Multi-Criterion Optimization - Third International Conference, EMO 2005
    • X Gandibleux M Ehrgott 2005 1984-2004-20 years of multiobjective. Metaheuristics. But what about the solution of combinatorial problems with multiple objectives? Lect Notes Comput Sci 3410 33 46 10.1007/978-3-540-31880-4- 3 (Pubitemid 41251754)
    • (2005) Lecture Notes in Computer Science , vol.3410 , pp. 33-46
    • Gandibleux, X.1    Ehrgott, M.2
  • 22
    • 0034244788 scopus 로고    scopus 로고
    • Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
    • 0969.90079 10.1023/A:1009682532542
    • X Gandibleux A Fréville 2000 Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: the two objectives case J Heur 6 361 383 0969.90079 10.1023/A:1009682532542
    • (2000) J Heur , vol.6 , pp. 361-383
    • Gandibleux, X.1    Fréville, A.2
  • 23
    • 78650129252 scopus 로고    scopus 로고
    • Improvements for multi-objective flow shop scheduling by Pareto Iterated Local Search
    • Hamburg, 13-16 July 2009
    • Geiger MJ (2009) Improvements for multi-objective flow shop scheduling by Pareto Iterated Local Search. In: Proceedings of the 8th Metaheuristics International Conference MIC 2009, Hamburg, 13-16 July 2009, pp 195.1-195.10
    • (2009) Proceedings of the 8th Metaheuristics International Conference MIC 2009 , pp. 1951-19510
    • Geiger, M.J.1
  • 24
    • 0036027960 scopus 로고    scopus 로고
    • Local search heuristics for two-stage flow shop problems with secondary criterion
    • DOI 10.1016/S0305-0548(00)00061-7, PII S0305054800000617
    • JND Gupta K Hennig F Werner 2002 Local search heuristics for two-stage flow shop problems with secondary criterion Comput Oper Res 29 123 149 1026.90103 10.1016/S0305-0548(00)00061-7 (Pubitemid 32944292)
    • (2002) Computers and Operations Research , vol.29 , Issue.2 , pp. 123-149
    • Gupta, J.N.D.1    Hennig, K.2    Werner, F.3
  • 25
    • 0035852852 scopus 로고    scopus 로고
    • Minimizing total flow time in a two-machine flowshop problem with minimum makespan
    • DOI 10.1016/S0925-5273(00)00039-6
    • JND Gupta VR Neppalli F Werner 2001 Minimizing total flow time in a two-machine flowshop problem with minimum makespan Int J Prod Econ 69 323 338 10.1016/S0925-5273(00)00039-6 (Pubitemid 32139255)
    • (2001) International Journal of Production Economics , vol.69 , Issue.3 , pp. 323-338
    • Gupta, J.N.D.1    Neppalli, V.R.2    Werner, F.3
  • 26
    • 0032633850 scopus 로고    scopus 로고
    • Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion
    • 10.1080/095372899233217
    • JND Gupta N Palanimuthu C-L Chen 1999 Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion Prod Plan Control 10 251 265 10.1080/095372899233217
    • (1999) Prod Plan Control , vol.10 , pp. 251-265
    • Gupta, J.N.D.1    Palanimuthu, N.2    Chen, C.-L.3
  • 27
    • 0003688852 scopus 로고    scopus 로고
    • Evaluating the quality of approximations to the nondominated set
    • Institute of Mathematical Modelling (1998-7), Technical University of Denmark
    • Hansen MP, Jaszkiewicz A (1998) Evaluating the quality of approximations to the nondominated set. Technical Report, Institute of Mathematical Modelling (1998-7), Technical University of Denmark
    • (1998) Technical Report
    • Hansen, M.P.1    Jaszkiewicz, A.2
  • 28
    • 13544266187 scopus 로고    scopus 로고
    • Multicriteria scheduling
    • DOI 10.1016/j.ejor.2004.07.011, PII S0377221704004680, Multicriteria Scheduling
    • H Hoogeveen 2005 Multicriteria scheduling Eur J Oper Res 167 592 623 2157061 1154.90458 10.1016/j.ejor.2004.07.011 (Pubitemid 40220081)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 592-623
    • Hoogeveen, H.1
  • 30
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic local search in memetic algorithms for multiobjective permutation flowshop scheduling
    • 10.1109/TEVC.2003.810752
    • H Ishibuchi T Yoshida T Murata 2003 Balance between genetic local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Trans Evol Comput 7 2 204 223 10.1109/TEVC.2003.810752
    • (2003) IEEE Trans Evol Comput , vol.7 , Issue.2 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 31
    • 0037116765 scopus 로고    scopus 로고
    • Genetic local search for multi-objective combinatorial optimization
    • DOI 10.1016/S0377-2217(01)00104-7, PII S0377221701001047
    • A Jaszkiewicz 2002 Genetic local search for multi-objective combinatorial optimization Eur J Oper Res 137 50 71 1869276 1002.90051 10.1016/S0377-2217(01) 00104-7 (Pubitemid 33127937)
    • (2002) European Journal of Operational Research , vol.137 , Issue.1 , pp. 50-71
    • Jaszkiewicz, A.1
  • 32
    • 0037116761 scopus 로고    scopus 로고
    • Multi-objective meta-heuristics: An overview of the current state-of-the-art
    • DOI 10.1016/S0377-2217(01)00123-0, PII S0377221701001230
    • DF Jones SK Mirrazavi M Tamiz 2002 Multi-objective meta-heuristics: an overview of the current state-of-the-art Eur J Oper Res 137 1 9 1002.90060 10.1016/S0377-2217(01)00123-0 (Pubitemid 33126005)
    • (2002) European Journal of Operational Research , vol.137 , Issue.1 , pp. 1-9
    • Jones, D.F.1    Mirrazavi, S.K.2    Tamiz, M.3
  • 33
    • 67651232712 scopus 로고    scopus 로고
    • Multi-objective production scheduling: A survey
    • 10.1007/s00170-008-1770-4
    • D Lei 2008 Multi-objective production scheduling: a survey Int J Adv Manuf Technol 43 926 938 10.1007/s00170-008-1770-4
    • (2008) Int J Adv Manuf Technol , vol.43 , pp. 926-938
    • Lei, D.1
  • 35
    • 77952241821 scopus 로고    scopus 로고
    • Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
    • 10.1007/s10732-009-9108-4
    • Y-C Liang M-H Lo 2009 Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm J Heur 16 3 511 535 10.1007/s10732-009-9108-4
    • (2009) J Heur , vol.16 , Issue.3 , pp. 511-535
    • Liang, Y.-C.1    Lo, M.-H.2
  • 37
    • 5144232432 scopus 로고    scopus 로고
    • Solving multi-objective production scheduling problems using metaheuristics
    • 2095871 1065.90040 10.1016/j.ejor.2003.08.029
    • T Loukil J Teghem D Tuyttens 2005 Solving multi-objective production scheduling problems using metaheuristics Eur J Oper Res 161 1 42 61 2095871 1065.90040 10.1016/j.ejor.2003.08.029
    • (2005) Eur J Oper Res , vol.161 , Issue.1 , pp. 42-61
    • Loukil, T.1    Teghem, J.2    Tuyttens, D.3
  • 38
    • 61349108680 scopus 로고    scopus 로고
    • A review and evaluation of multi-objective algorithms for the flowshop scheduling problem
    • 2437211 10.1287/ijoc.1070.0258
    • G Minella R Ruiz M Ciavotta 2008 A review and evaluation of multi-objective algorithms for the flowshop scheduling problem Informs J Comput 20 3 451 471 2437211 10.1287/ijoc.1070.0258
    • (2008) Informs J Comput , vol.20 , Issue.3 , pp. 451-471
    • Minella, G.1    Ruiz, R.2    Ciavotta, M.3
  • 39
    • 0031281221 scopus 로고    scopus 로고
    • Variable neighborhood search
    • 1471346 0889.90119 10.1016/S0305-0548(97)00031-2
    • N Mladenović P Hansen 1997 Variable neighborhood search Comput Oper Res 24 1097 1100 1471346 0889.90119 10.1016/S0305-0548(97)00031-2
    • (1997) Comput Oper Res , vol.24 , pp. 1097-1100
    • Mladenović, N.1    Hansen, P.2
  • 40
    • 84931338189 scopus 로고    scopus 로고
    • Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
    • Evolutionary Multi-Criterion Optimization
    • Murata T, Ishibuchi H, Gen M (2001) Cellular genetic local search for multi-objective optimization. Lecture notes in computer science: evolutionary multi-criterion optimization, 1993:82-95 (Pubitemid 33241380)
    • (2001) Lecture Notes in Computer Science , Issue.1993 , pp. 82-95
    • Murata, T.1    Ishibuchi, H.2    Gen, M.3
  • 41
    • 0030241820 scopus 로고    scopus 로고
    • Multi-objective genetic algorithm and its applications to flowshop scheduling
    • DOI 10.1016/0360-8352(96)00045-9
    • T Murata H Ishibuchi H Tanaka 1996 Multi-objective genetic algorithm and its applications to flowshop scheduling Comput Ind Eng 30 957 968 10.1016/0360-8352(96)00045-9 (Pubitemid 126375906)
    • (1996) Computers and Industrial Engineering , vol.30 , Issue.4 , pp. 957-968
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 42
    • 0029254827 scopus 로고
    • Multiple and bicriteria scheduling: A literatura survey
    • 0913.90178 10.1016/0377-2217(93)E0140-S
    • A Nagar J Haddock S Heragu 1995 Multiple and bicriteria scheduling: a literatura survey Eur J Oper Res 81 88 104 0913.90178 10.1016/0377-2217(93) E0140-S
    • (1995) Eur J Oper Res , vol.81 , pp. 88-104
    • Nagar, A.1    Haddock, J.2    Heragu, S.3
  • 43
    • 0029322972 scopus 로고
    • A branch and bound approach for a 2-machine flowshop scheduling problem
    • 0832.90058
    • A Nagar S Heragu J Haddock 1995 A branch and bound approach for a 2-machine flowshop scheduling problem J Oper Res Soc 46 721 734 0832.90058
    • (1995) J Oper Res Soc , vol.46 , pp. 721-734
    • Nagar, A.1    Heragu, S.2    Haddock, J.3
  • 44
    • 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 I Ham 1983 A heuristic algorithm for the m-machine, n-job flowshop sequencing problem Omega 11 91 98 10.1016/0305-0483(83)90088-9 (Pubitemid 13193807)
    • (1983) Omega , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 46
    • 29344433807 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
    • 10.1007/s00170-004-2249-6
    • T Pasupathy C Rajendran RK Suresh 2005 A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs Int J Adv Manuf Technol 27 804 815 10.1007/s00170-004-2249-6
    • (2005) Int J Adv Manuf Technol , vol.27 , pp. 804-815
    • Pasupathy, T.1    Rajendran, C.2    Suresh, R.K.3
  • 47
    • 33751090978 scopus 로고    scopus 로고
    • A multi-objective particle swarm for a flow shop scheduling problem
    • DOI 10.1007/s10878-006-9015-7
    • ARV Rahimi SM Mirghorbani 2007 A multi-objective particle swarm for a flow shop scheduling problem J Comb Optim 13 79 102 2273265 1112.90037 10.1007/s10878-006-9015-7 (Pubitemid 44771158)
    • (2007) Journal of Combinatorial Optimization , vol.13 , Issue.1 , pp. 79-102
    • Rahimi-Vahed, A.R.1    Mirghorbani, S.M.2
  • 48
    • 0026923562 scopus 로고
    • Two-stage flowshop scheduling problem with bicriteria
    • C Rajendran 1992 Two-stage flow shop scheduling problem with bicriterio J Oper Res Soc 43 871 884 0757.90037 (Pubitemid 23557910)
    • (1992) Journal of the Operational Research Society , vol.43 , Issue.9 , pp. 871-884
    • Rajendran, C.1
  • 49
    • 0029635352 scopus 로고
    • Heuristics for scheduling in flowshop with multiple objectives
    • 0905.90107 10.1016/0377-2217(93)E0212-G
    • C Rajendran 1995 Heuristics for scheduling in flowshop with multiple objectives Eur J Oper Res 82 540 555 0905.90107 10.1016/0377-2217(93)E0212-G
    • (1995) Eur J Oper Res , vol.82 , pp. 540-555
    • Rajendran, C.1
  • 50
    • 78049319860 scopus 로고    scopus 로고
    • A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs
    • U.K. Chakraborty (eds). Springer Heidelberg. 10.1007/978-3-642-02836-6-3
    • Rajendran C, Ziegler H (2009) A multi-objective ant-colony algorithm for permutation flowshop scheduling to minimize the makespan and total flowtime of jobs. In: Chakraborty UK (ed) Studies in computational intelligence, computational intelligence in flow shop and job shop scheduling vol 230. Springer, Heidelberg, pp 53-99
    • (2009) Studies in Computational Intelligence, Computational Intelligence in Flow Shop and Job Shop Scheduling Vol 230 , pp. 53-99
    • Rajendran, C.1    Ziegler, H.2
  • 51
    • 55549102282 scopus 로고    scopus 로고
    • A multi-objective GRASP for partial classification
    • 10.1007/s00500-008-0320-1
    • AP Reynolds BD Iglesia 2009 A multi-objective GRASP for partial classification Soft Comput 13 3 227 243 10.1007/s00500-008-0320-1
    • (2009) Soft Comput , vol.13 , Issue.3 , pp. 227-243
    • Reynolds, A.P.1    Iglesia, B.D.2
  • 52
    • 0033102018 scopus 로고    scopus 로고
    • A bicriteria approach to the two-machine flow shop scheduling problem
    • 0957.90064 10.1016/S0377-2217(98)00009-5
    • S Sayin S Karabati 1999 A bicriteria approach to the two-machine flow shop scheduling problem Eur J Oper Res 113 435 449 0957.90064 10.1016/S0377-2217(98)00009-5
    • (1999) Eur J Oper Res , vol.113 , pp. 435-449
    • Sayin, S.1    Karabati, S.2
  • 53
    • 0032094736 scopus 로고    scopus 로고
    • A bicriteria two-machine permutation flowshop problem
    • PII S037722179700338X
    • FS Şerifoǧlu G Ulusoy 1998 A bicriteria two-machine permutation flowshop problem Eur J Oper Res 107 414 430 0943.90041 10.1016/S0377-2217(97)00338-X (Pubitemid 128407554)
    • (1998) European Journal of Operational Research , vol.107 , Issue.2 , pp. 414-430
    • Sivrikaya-Serifoglu, F.1    Ulusoy, G.2
  • 54
    • 0035314562 scopus 로고    scopus 로고
    • Multicriteria scheduling problems: A survey
    • DOI 10.1051/ro:2001109
    • V T'kindt J-C Billaut 2001 Multicriteria scheduling problems: a survey RAIRO Oper Res 35 143 163 1868867 1014.90046 10.1051/ro:2001109 (Pubitemid 33102967)
    • (2001) RAIRO Recherche Operationnelle , vol.35 , Issue.2 , pp. 143-163
    • T'kindt, V.1    Billaut, J.-C.2
  • 55
    • 0035900279 scopus 로고    scopus 로고
    • Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
    • DOI 10.1016/S0377-2217(00)00288-5, PII S0377221700002885
    • V T'kindt J-C Billaut C Proust 2001 Solving bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry Eur J Oper Res 135 42 49 1077.90532 10.1016/S0377-2217(00)00288-5 (Pubitemid 32776178)
    • (2001) European Journal of Operational Research , vol.135 , Issue.1 , pp. 42-49
    • T'Kindt, V.1    Billaut, J.-C.2    Proust, C.3
  • 56
    • 0032188457 scopus 로고    scopus 로고
    • Efficiency of interactive multi-objective simulated annealing through a case study
    • EL Ulungu J Teghem Ch Ost 1998 Efficiency of interactive multi-objective simulated annealing through a case study J Oper Res Soc 49 1044 1050 1140.90460 (Pubitemid 128592218)
    • (1998) Journal of the Operational Research Society , vol.49 , Issue.10 , pp. 1044-1050
    • Ulungu, E.L.1    Teghem, J.2    Ost, Ch.3
  • 57
    • 0034201456 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms: Analysing the state-of -art
    • 10.1162/106365600568158
    • DA Van Veldhuizen GB Lamont 2000 Multiobjective evolutionary algorithms: analysing the state-of -art Evol Comput 8 125 147 10.1162/106365600568158
    • (2000) Evol Comput , vol.8 , pp. 125-147
    • Van Veldhuizen, D.A.1    Lamont, G.B.2
  • 58
    • 0033676661 scopus 로고    scopus 로고
    • Congress on evolutionary, on measuring multiobjective evolutionary algorithm performance
    • DA Van Veldhuizen GB Lamont 2000 Congress on evolutionary, on measuring multiobjective evolutionary algorithm performance Computation 1 204 211
    • (2000) Computation , vol.1 , pp. 204-211
    • Van Veldhuizen, D.A.1    Lamont, G.B.2
  • 59
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • DOI 10.1016/j.ejor.2004.07.020, PII S0377221704004771, Multicriteria Scheduling
    • TK Varadharajan C Rajendran 2005 A multi-objective simulated annealing for scheduling in flow shops to minimize the makespan and total flow time of jobs Eur J Oper Res 167 772 795 2157070 1154.90499 10.1016/j.ejor.2004.07.020 (Pubitemid 40220090)
    • (2005) European Journal of Operational Research , vol.167 , Issue.3 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2
  • 60
    • 38149009704 scopus 로고    scopus 로고
    • Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off
    • 10.1061/(ASCE)0733-9364(2008)134:2(153)
    • Y Xiong Y Kuang 2008 Applying an ant colony optimization algorithm-based multiobjective approach for time-cost trade-off J Constr Eng M Asce 134 2 153 156 10.1061/(ASCE)0733-9364(2008)134:2(153)
    • (2008) J Constr Eng M Asce , vol.134 , Issue.2 , pp. 153-156
    • Xiong, Y.1    Kuang, Y.2
  • 61
    • 38849110113 scopus 로고    scopus 로고
    • Ant colony optimization for multi-objective flow shop scheduling problem
    • DOI 10.1016/j.cie.2007.08.003, PII S0360835207001933
    • B Yagmahan MM Yenisey 2008 Ant colony optimization for multi-objective flow shop scheduling problem Comput Ind Eng 54 3 411 420 10.1016/j.cie.2007.08. 003 (Pubitemid 351199794)
    • (2008) Computers and Industrial Engineering , vol.54 , Issue.3 , pp. 411-420
    • Yagmahan, B.1    Yenisey, M.M.2
  • 62
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective evolutionary algorithms a comparative case study and the strength pareto approach
    • DOI 10.1109/4235.797969
    • E Zitzler L Thiele 1999 Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach IEEE Trans Evol Comput 3 4 257 271 10.1109/4235.797969 (Pubitemid 30544879)
    • (1999) IEEE Transactions on Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler Eckart1    Thiele Lothar2


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