메뉴 건너뛰기




Volumn 43, Issue 9-10, 2009, Pages 925-938

Multi-objective production scheduling: A survey

Author keywords

Deterministic scheduling; Multiple objectives; Scheduling problem; Uncertainty

Indexed keywords

BI-OBJECTIVE SCHEDULING; DECISION MAKERS; DETERMINISTIC PROBLEMS; DETERMINISTIC SCHEDULING; MULTI OBJECTIVE; MULTI-OBJECTIVE SCHEDULING; MULTIPLE OBJECTIVES; PRODUCTION SCHEDULING; SCHEDULING PROBLEM; UNCERTAINTY;

EID: 67651232712     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-008-1770-4     Document Type: Article
Times cited : (121)

References (110)
  • 1
    • 0029254827 scopus 로고
    • Multiple and bicriteria scheduling: A literature survey
    • A Nagar J Haddock S Heragu 1995 Multiple and bicriteria scheduling: a literature survey Eur J Oper Res 81 88 104
    • (1995) Eur J Oper Res , vol.81 , pp. 88-104
    • Nagar, A.1    Haddock, J.2    Heragu, S.3
  • 2
    • 0035314562 scopus 로고    scopus 로고
    • Multicriteria scheduling problems: a survey
    • V T'Kindt J Billaut C Proust 2001 Multicriteria scheduling problems: a survey RAIRO Oper Res 35 143 163
    • (2001) RAIRO Oper Res , vol.35 , pp. 143-163
    • T'Kindt, V.1    Billaut, J.2    Proust, C.3
  • 3
    • 13544266187 scopus 로고    scopus 로고
    • Multicriteria scheduling
    • H Hoogeveen 2005 Multicriteria scheduling Eur J Oper Res 167 592 623
    • (2005) Eur J Oper Res , vol.167 , pp. 592-623
    • Hoogeveen, H.1
  • 4
    • 0034199912 scopus 로고    scopus 로고
    • Approximating the non-dominated front using the Pareto archive evolutionary strategy
    • JD Knowles DW Corne 2000 Approximating the non-dominated front using the Pareto archive evolutionary strategy Evol Comput 8 2 149 172
    • (2000) Evol Comput , vol.8 , Issue.2 , pp. 149-172
    • Knowles, J.D.1    Corne, D.W.2
  • 5
    • 0033318858 scopus 로고    scopus 로고
    • Multi-objective evolutionary algorithms: a comparative case study and the strength pareto approach
    • E Zitzler L Thiele 1999 Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach IEEE Trans Evol Comput 3 4 257 271
    • (1999) IEEE Trans Evol Comput , vol.3 , Issue.4 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 7
    • 0037448810 scopus 로고    scopus 로고
    • Using genetic algorithms for single-machine bicriteria scheduling problems
    • M Köksalan AB Keha 2003 Using genetic algorithms for single-machine bicriteria scheduling problems Eur J Oper Res 145 543 556
    • (2003) Eur J Oper Res , vol.145 , pp. 543-556
    • M. Köksalan1    Keha, A.B.2
  • 8
    • 27544509423 scopus 로고    scopus 로고
    • Single machine scheduling with multiple objectives in semiconductor manufacturing
    • AK Gupta AI Sivakumar 2005 Single machine scheduling with multiple objectives in semiconductor manufacturing Int J Adv Manuf Technol 26 950 958
    • (2005) Int J Adv Manuf Technol , vol.26 , pp. 950-958
    • Gupta, A.K.1    Sivakumar, A.I.2
  • 9
    • 0038789163 scopus 로고    scopus 로고
    • Single machine scheduling with maximum earliness and number tardy
    • M Azizoglu S Kondakci M Köksalan 2003 Single machine scheduling with maximum earliness and number tardy Comput Ind Eng 45 257 268
    • (2003) Comput Ind Eng , vol.45 , pp. 257-268
    • Azizoglu, M.1    Kondakci, S.2    M. Köksalan3
  • 10
    • 36049034643 scopus 로고    scopus 로고
    • Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
    • F Jolai M Rabbani S Amalnick A Dabaghi M Dehghan MY Parast 2007 Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs Appl Math Comput 194 552 560
    • (2007) Appl Math Comput , vol.194 , pp. 552-560
    • Jolai, F.1    Rabbani, M.2    Amalnick, S.3    Dabaghi, A.4    Dehghan, M.5    Parast, M.Y.6
  • 11
    • 33846451096 scopus 로고    scopus 로고
    • Multiobjective single machine scheduling with non-traditional requirements
    • U Haral R-W Chen WGJ Ferrell MB Kurz 2007 Multiobjective single machine scheduling with non-traditional requirements Int J Prod Econ 106 574 484
    • (2007) Int J Prod Econ , vol.106 , pp. 574-484
    • Haral, U.1    Chen R-W2    Ferrell, W.G.J.3    Kurz, M.B.4
  • 12
    • 33747373886 scopus 로고    scopus 로고
    • A bicriteria scheduling with sequence-dependent setup times
    • T Eren E Güner 2006 A bicriteria scheduling with sequence-dependent setup times Appl Math Comput 179 378 385
    • (2006) Appl Math Comput , vol.179 , pp. 378-385
    • Eren, T.1    E. Güner2
  • 13
    • 35248836033 scopus 로고    scopus 로고
    • An efficient algorithm for scheduling jobs on a machine with periodic maintenance
    • W-J Chen 2007 An efficient algorithm for scheduling jobs on a machine with periodic maintenance Int J Adv Manuf Technol 34 1173 1182
    • (2007) Int J Adv Manuf Technol , vol.34 , pp. 1173-1182
    • Chen W-J1
  • 14
    • 0029733044 scopus 로고    scopus 로고
    • Bicriteria scheduling problem for unrelated parallel machines
    • V Suresh D Chaudhuri 1996 Bicriteria scheduling problem for unrelated parallel machines Comput Ind Eng 30 77 82
    • (1996) Comput Ind Eng , vol.30 , pp. 77-82
    • Suresh, V.1    Chaudhuri, D.2
  • 15
    • 0035900279 scopus 로고    scopus 로고
    • Solving a bicriteria scheduling on unrelated parallel machines occurring in the glass bottle industry
    • V T'kindt J-C Billaut C Proust 2001 Solving a bicriteria scheduling on unrelated parallel machines occurring in the glass bottle industry Eur J Oper Res 135 42 49
    • (2001) Eur J Oper Res , vol.135 , pp. 42-49
    • T'kindt, V.1    Billaut J-C2    Proust, C.3
  • 16
    • 0037410718 scopus 로고    scopus 로고
    • A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines
    • JK Cochran S-M Horng JW Fowler 2003 A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines Comput Oper Res 30 1087 1102
    • (2003) Comput Oper Res , vol.30 , pp. 1087-1102
    • Cochran, J.K.1    Horng S-M2    Fowler, J.W.3
  • 17
    • 0030241820 scopus 로고    scopus 로고
    • Multi-objective genetic algorithm and its applications to flow shop scheduling
    • T Murata H Ishibuchi H Tanaka 1996 Multi-objective genetic algorithm and its applications to flow shop scheduling Comput Ind Eng 30 957 968
    • (1996) Comput Ind Eng , vol.30 , pp. 957-968
    • Murata, T.1    Ishibuchi, H.2    Tanaka, H.3
  • 18
    • 24144460572 scopus 로고    scopus 로고
    • Two-phase sub-population genetic algorithm for parallel- machine scheduling problem
    • P-C Chang S-H Chen K-L Lin 2005 Two-phase sub-population genetic algorithm for parallel- machine scheduling problem Expert Syst Appl 29 705 712
    • (2005) Expert Syst Appl , vol.29 , pp. 705-712
    • Chang P-C1    Chen S-H2    Lin K-L3
  • 20
  • 21
    • 33750351559 scopus 로고    scopus 로고
    • A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem
    • Chang P-C, Chen S-H, Hsieh J-C (2006) A global archive sub-population genetic algorithm with adaptive strategy in multi-objective parallel-machine scheduling problem. Proceedings of International Conference on Natural Computation, pp 730-739
    • (2006) Proceedings of International Conference on Natural Computation , pp. 730-739
    • Chang, P.-C.1    Chen, S.-H.2    Hsieh, J.-C.3
  • 22
    • 57349157020 scopus 로고    scopus 로고
    • A bicriteria parallel machine scheduling with a learning effect of setup and removal times
    • (in press)
    • Eren T (2008) A bicriteria parallel machine scheduling with a learning effect of setup and removal times. Appl Math Model (in press)
    • (2008) Appl Math Model
    • Eren, T.1
  • 23
    • 0033136545 scopus 로고    scopus 로고
    • A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
    • D Danneberg T Tautenhahn F Werner 1999 A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size Math Comput Model 29 101 126
    • (1999) Math Comput Model , vol.29 , pp. 101-126
    • Danneberg, D.1    Tautenhahn, T.2    Werner, F.3
  • 24
    • 0032094736 scopus 로고    scopus 로고
    • A bicriteria two-machine permutation flowshop problem
    • F Sivrikaya-Serifoǧlu G Ulusoy 1998 A bicriteria two-machine permutation flowshop problem Eur J Oper Res 107 414 430
    • (1998) Eur J Oper Res , vol.107 , pp. 414-430
    • F. Sivrikaya-Serifoǧlu1    Ulusoy, G.2
  • 25
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic search and local search in memetic algorithms for multi-objective permutation flow shop
    • H Ishibuchi T Yoshida T Murata 2003 Balance between genetic search and local search in memetic algorithms for multi-objective permutation flow shop IEEE Trans Evol Comput 17 2 204 223
    • (2003) IEEE Trans Evol Comput , vol.17 , Issue.2 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 26
    • 33847245879 scopus 로고    scopus 로고
    • On operators and search space topology in multi-objective flow shop scheduling
    • MJ Geiger 2007 On operators and search space topology in multi-objective flow shop scheduling Eur J Oper Res 181 195 206
    • (2007) Eur J Oper Res , vol.181 , pp. 195-206
    • Geiger, M.J.1
  • 27
    • 1642559633 scopus 로고    scopus 로고
    • Ant-colony algorithms for permutation flow shop scheduling to minimize makespan/total flowtime of jobs
    • C Rajendran H Ziegler 2004 Ant-colony algorithms for permutation flow shop scheduling to minimize makespan/total flowtime of jobs Eur J Oper Res 155 426 438
    • (2004) Eur J Oper Res , vol.155 , pp. 426-438
    • Rajendran, C.1    Ziegler, H.2
  • 29
    • 33751374104 scopus 로고    scopus 로고
    • Solving a bi-objective flowshop scheduling problem by Pareto-ant colony optimization
    • et al. (eds.) ANTS
    • Pasia JM, Hartl RF, Doerner KF (2006) Solving a bi-objective flowshop scheduling problem by Pareto-ant colony optimization. Proceedings of M. Dorigo et al. (eds.) ANTS, pp 294-305
    • (2006) Proceedings of M. Dorigo , pp. 294-305
    • Pasia, J.M.1    Hartl, R.F.2    Doerner, K.F.3
  • 30
    • 5144232432 scopus 로고    scopus 로고
    • Solving multi-objective production scheduling problems using metaheuristics
    • T Loukil J Teghem D Tuyttens 2005 Solving multi-objective production scheduling problems using metaheuristics Eur J Oper Res 161 42 61
    • (2005) Eur J Oper Res , vol.161 , pp. 42-61
    • Loukil, T.1    Teghem, J.2    Tuyttens, D.3
  • 31
    • 13544263208 scopus 로고    scopus 로고
    • A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
    • TK Varadharajan C Rajendran 2005 A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs Eur J Oper Res 167 772 795
    • (2005) Eur J Oper Res , vol.167 , pp. 772-795
    • Varadharajan, T.K.1    Rajendran, C.2
  • 32
    • 6944244339 scopus 로고    scopus 로고
    • An application of a multi-objective tabu search algorithm to a bi-criteria flow shop problem
    • VA Armentano JEC Arroyo 2004 An application of a multi-objective tabu search algorithm to a bi-criteria flow shop problem J Heur 10 463 481
    • (2004) J Heur , vol.10 , pp. 463-481
    • Armentano, V.A.1    Arroyo, J.E.C.2
  • 33
    • 33748568117 scopus 로고    scopus 로고
    • Design of cooperative algorithms for multi-objective optimization: application to the flow shop scheduling problem
    • M Basseur 2006 Design of cooperative algorithms for multi-objective optimization: application to the flow shop scheduling problem Quart J Oper Res 4 255 258
    • (2006) Quart J Oper Res , vol.4 , pp. 255-258
    • Basseur, M.1
  • 34
    • 29344433807 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for searching in flow shop to minimize the makespan and the total flow time of jobs
    • T Pasupathy C Rajendran RK Suresh 2006 A multi-objective genetic algorithm for searching in flow shop to minimize the makespan and the total flow time of jobs Int J Adv Manuf Technol 27 804 815
    • (2006) Int J Adv Manuf Technol , vol.27 , pp. 804-815
    • Pasupathy, T.1    Rajendran, C.2    Suresh, R.K.3
  • 35
    • 33751090978 scopus 로고    scopus 로고
    • A multi-objective particle swarm for a flow shop scheduling problem
    • AR Rahimi-Vahed SM Mirghorbani 2007 A multi-objective particle swarm for a flow shop scheduling problem J Comb Optim 13 79 102
    • (2007) J Comb Optim , vol.13 , pp. 79-102
    • Rahimi-Vahed, A.R.1    Mirghorbani, S.M.2
  • 37
    • 44849083459 scopus 로고    scopus 로고
    • An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
    • B Qian L Wang D-X Huang W-L Wang X Wang 2009 An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers Comput Oper Res 36 209 233
    • (2009) Comput Oper Res , vol.36 , pp. 209-233
    • Qian, B.1    Wang, L.2    Huang D-X3    Wang W-L4    Wang, X.5
  • 38
    • 0037410252 scopus 로고    scopus 로고
    • The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
    • A Allahverdi 2003 The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime Eur J Oper Res 147 373 396
    • (2003) Eur J Oper Res , vol.147 , pp. 373-396
    • Allahverdi, A.1
  • 39
    • 0346462895 scopus 로고    scopus 로고
    • A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
    • A Allahverdi 2004 A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness Comput Oper Res 31 157 180
    • (2004) Comput Oper Res , vol.31 , pp. 157-180
    • Allahverdi, A.1
  • 40
    • 0141636335 scopus 로고    scopus 로고
    • No-wait flowshops with bicriteria of makespan and maximum lateness
    • A Allahverdi T Aldowaisan 2004 No-wait flowshops with bicriteria of makespan and maximum lateness Eur J Oper Res 152 132 147
    • (2004) Eur J Oper Res , vol.152 , pp. 132-147
    • Allahverdi, A.1    Aldowaisan, T.2
  • 41
    • 0036723791 scopus 로고    scopus 로고
    • No-wait flowshops with bicriteria of makespan and total completion time
    • A Allahverdi T Aldowaisan 2002 No-wait flowshops with bicriteria of makespan and total completion time J Oper Res Soc 53 1004 1015
    • (2002) J Oper Res Soc , vol.53 , pp. 1004-1015
    • Allahverdi, A.1    Aldowaisan, T.2
  • 42
    • 0347834986 scopus 로고    scopus 로고
    • Dual criteria scheduling on a two-machine flowshop subject to random breakdowns
    • A Allahverdi J Mittenthal 1998 Dual criteria scheduling on a two-machine flowshop subject to random breakdowns Int Trans Oper Res 5 317 324
    • (1998) Int Trans Oper Res , vol.5 , pp. 317-324
    • Allahverdi, A.1    Mittenthal, J.2
  • 43
    • 1442333196 scopus 로고    scopus 로고
    • The tricriteria two-machine flowshop scheduling problem
    • A Allahverdi 2001 The tricriteria two-machine flowshop scheduling problem Int Trans Oper Res 8 403 425
    • (2001) Int Trans Oper Res , vol.8 , pp. 403-425
    • Allahverdi, A.1
  • 44
    • 0036732290 scopus 로고    scopus 로고
    • Scheduling on three-serial duplicate stations in assembly lines with multiple criteria
    • A Allahverdi M Savsar 2002 Scheduling on three-serial duplicate stations in assembly lines with multiple criteria Int J Ind Eng 9 265 274
    • (2002) Int J Ind Eng , vol.9 , pp. 265-274
    • Allahverdi, A.1    Savsar, M.2
  • 45
    • 43249106280 scopus 로고    scopus 로고
    • The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time
    • A Allahverdi FS Al-Anzi 2008 The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time Int J Adv Manuf Technol 37 166 177
    • (2008) Int J Adv Manuf Technol , vol.37 , pp. 166-177
    • Allahverdi, A.1    Al-Anzi, F.S.2
  • 46
    • 33749556859 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime
    • WC Yeh A Allahverdi 2004 A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan and total flowtime Int Trans Oper Res 11 341 359
    • (2004) Int Trans Oper Res , vol.11 , pp. 341-359
    • Yeh, W.C.1    Allahverdi, A.2
  • 47
    • 0029635352 scopus 로고
    • Heuristics for scheduling in flow shop with multiple objectives
    • C Rajendran 1995 Heuristics for scheduling in flow shop with multiple objectives Eur J Oper Res 82 540 555
    • (1995) Eur J Oper Res , vol.82 , pp. 540-555
    • Rajendran, C.1
  • 49
    • 0033161818 scopus 로고    scopus 로고
    • Two-machine flowshop scheduling with bicriteria problem
    • F-D Chou C-F Lee 1999 Two-machine flowshop scheduling with bicriteria problem Comput Ind Eng 36 549 564
    • (1999) Comput Ind Eng , vol.36 , pp. 549-564
    • Chou F-D1    Lee C-F2
  • 50
    • 27844432400 scopus 로고    scopus 로고
    • A combined branch-and-bound and genetic algorithm based approach for flow shop scheduling problem
    • A Nagar J Haddock S Heragu 1996 A combined branch-and-bound and genetic algorithm based approach for flow shop scheduling problem Ann Oper Res 63 397 414
    • (1996) Ann Oper Res , vol.63 , pp. 397-414
    • Nagar, A.1    Haddock, J.2    Heragu, S.3
  • 52
    • 0033102018 scopus 로고    scopus 로고
    • A bicriteria approach to the two-machine flow shop scheduling problem
    • S Sayin S Karabati 1999 A bicriteria approach to the two-machine flow shop scheduling problem Eur J Oper Res 113 435 449
    • (1999) Eur J Oper Res , vol.113 , pp. 435-449
    • Sayin, S.1    Karabati, S.2
  • 53
    • 2042473473 scopus 로고    scopus 로고
    • Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
    • B Toktas M Azizoglu SK Koksalan 2004 Two-machine flow shop scheduling with two criteria: maximum earliness and makespan Eur J Oper Res 157 286 295
    • (2004) Eur J Oper Res , vol.157 , pp. 286-295
    • Toktas, B.1    Azizoglu, M.2    Koksalan, S.K.3
  • 54
    • 0030572949 scopus 로고    scopus 로고
    • Genetic algorithms for the two-stage bicriteria flowshop problem
    • VR Neppalli C-L Chen JND Gupta 1996 Genetic algorithms for the two-stage bicriteria flowshop problem Eur J Oper Res 95 356 373
    • (1996) Eur J Oper Res , vol.95 , pp. 356-373
    • Neppalli, V.R.1    Chen C-L2    Gupta, J.N.D.3
  • 55
    • 0030192321 scopus 로고    scopus 로고
    • Scheduling in flow shop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach
    • J Sridhar C Rajendran 1996 Scheduling in flow shop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach Prod Plann Contr 7 374 382
    • (1996) Prod Plann Contr , vol.7 , pp. 374-382
    • Sridhar, J.1    Rajendran, C.2
  • 56
    • 33847658312 scopus 로고    scopus 로고
    • Sub-population genetic algorithm with mining gene structures for multi-objective flow shop scheduling problems
    • P-C Chang S-H Chen C-H Liu 2007 Sub-population genetic algorithm with mining gene structures for multi-objective flow shop scheduling problems Expert Syst Appl 33 762 771
    • (2007) Expert Syst Appl , vol.33 , pp. 762-771
    • Chang P-C1    Chen S-H2    Liu C-H3
  • 57
    • 0032141635 scopus 로고    scopus 로고
    • A multi-objective genetic local search and its application to flow shop scheduling
    • H Ishibuchi T Murata 1998 A multi-objective genetic local search and its application to flow shop scheduling IEEE Trans Syst Man Cybern Part C 28 3 392 403
    • (1998) IEEE Trans Syst Man Cybern Part C , vol.28 , Issue.3 , pp. 392-403
    • Ishibuchi, H.1    Murata, T.2
  • 59
    • 13544262325 scopus 로고    scopus 로고
    • Genetic local search for multi-objective flow shop scheduling problems
    • JEC Arroyo VA Armentano 2005 Genetic local search for multi-objective flow shop scheduling problems Eur J Oper Res 167 717 738
    • (2005) Eur J Oper Res , vol.167 , pp. 717-738
    • Arroyo, J.E.C.1    Armentano, V.A.2
  • 62
    • 34249018250 scopus 로고    scopus 로고
    • A hybrid quantum-inspired genetic algorithm for multi-objective flow shop scheduling
    • B-B Li L Wang 2007 A hybrid quantum-inspired genetic algorithm for multi-objective flow shop scheduling IEEE Trans Syst Man Cybern Part B. 37 576 591
    • (2007) IEEE Trans Syst Man Cybern Part B. , vol.37 , pp. 576-591
    • Li B-B1    Wang, L.2
  • 63
    • 33845804392 scopus 로고    scopus 로고
    • A bicriteria flowshop scheduling problem with setup time
    • T Eren E Güner 2006 A bicriteria flowshop scheduling problem with setup time Appl Math Comput 183 1292 1300
    • (2006) Appl Math Comput , vol.183 , pp. 1292-1300
    • Eren, T.1    E. Güner2
  • 64
    • 43949118118 scopus 로고    scopus 로고
    • A bicriteria flowshop scheduling with a learning effect
    • Eren T, Güner E (2008) A bicriteria flowshop scheduling with a learning effect. Appl Math Model 32(9):1719-1733 doi: 10.1016/j.apm.2007.06.009
    • (2008) Appl Math Model , vol.32 , Issue.9 , pp. 1719-1733
    • Eren, T.1    Güner, E.2
  • 65
    • 43449107101 scopus 로고    scopus 로고
    • The triceiteria flowshop scheduling problem
    • T Eren E Güner 2008 The triceiteria flowshop scheduling problem Int J Adv Manuf Technol 36 1210 1220
    • (2008) Int J Adv Manuf Technol , vol.36 , pp. 1210-1220
    • Eren, T.1    E. Güner2
  • 66
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow shop sequencing problem
    • M Nawaz EE Enscore I Ham 1983 A heuristic algorithm for the m-machine, n-job flow shop sequencing problem Omega 11 91 95
    • (1983) Omega , vol.11 , pp. 91-95
    • Nawaz, M.1    Enscore, E.E.2    Ham, I.3
  • 67
    • 34548237317 scopus 로고    scopus 로고
    • A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
    • R Tavakkoli-Moghaddam A Rahimi-Vahed AH Mirzaei 2007 A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness Inf Sci 177 5072 5090
    • (2007) Inf Sci , vol.177 , pp. 5072-5090
    • Tavakkoli-Moghaddam, R.1    Rahimi-Vahed, A.2    Mirzaei, A.H.3
  • 68
    • 41149105271 scopus 로고    scopus 로고
    • Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm
    • R Tavakkoli-Moghaddam A Rahimi-Vahed AH Mirzaei 2008 Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm Int J Adv Manuf Technol 36 968 981
    • (2008) Int J Adv Manuf Technol , vol.36 , pp. 968-981
    • Tavakkoli-Moghaddam, R.1    Rahimi-Vahed, A.2    Mirzaei, A.H.3
  • 70
    • 38849110113 scopus 로고    scopus 로고
    • Ant colony optimization for multi-objective flow shop scheduling problem
    • B Yagmahan MM Yenisey 2008 Ant colony optimization for multi-objective flow shop scheduling problem Comput Ind Eng 54 411 420
    • (2008) Comput Ind Eng , vol.54 , pp. 411-420
    • Yagmahan, B.1    Yenisey, M.M.2
  • 71
    • 0037120688 scopus 로고    scopus 로고
    • An ant colony optimization algorithm to solve a 2-machine bicriteria flow shop scheduling problem
    • V T'kindt N Monmarché F Tercinet D Laügt 2002 An ant colony optimization algorithm to solve a 2-machine bicriteria flow shop scheduling problem Eur J Oper Res 142 250 257
    • (2002) Eur J Oper Res , vol.142 , pp. 250-257
    • T'kindt, V.1    N. Monmarché2    Tercinet, F.3    D. Laügt4
  • 72
    • 67651202468 scopus 로고    scopus 로고
    • Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness
    • (in press)
    • Ruiz R, Allahverdi A (2008) Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Comput Oper Res (in press)
    • (2008) Comput Oper Res
    • Ruiz, R.1    Allahverdi, A.2
  • 73
    • 33750007920 scopus 로고    scopus 로고
    • A bicriterian flow shop scheduling using artificial neural network
    • A Noorul Haq T Radha Ramanan 2006 A bicriterian flow shop scheduling using artificial neural network Int J Adv Manuf Technol 30 1132 1138
    • (2006) Int J Adv Manuf Technol , vol.30 , pp. 1132-1138
    • Noorul Haq, A.1    Radha Ramanan, T.2
  • 74
    • 60749120124 scopus 로고    scopus 로고
    • Bicriteria scheduling of a two-machine flow shop with sequence-dependent setup times
    • Mansouri SA, Hendizadeh SH Bicriteria scheduling of a two-machine flow shop with sequence-dependent setup times. Int J Adv Manuf Technol doi: 10.1007/s00170-008-1439-z
    • Int J Adv Manuf Technol
    • Mansouri, S.A.1    Hendizadeh, S.H.2
  • 75
    • 0031238029 scopus 로고    scopus 로고
    • Bicriterion scheduling in the two-machine flowshop
    • CJ Liao CJ Yu CB Joe 1997 Bicriterion scheduling in the two-machine flowshop J Oper Res Soc 48 929 935
    • (1997) J Oper Res Soc , vol.48 , pp. 929-935
    • Liao, C.J.1    Yu, C.J.2    Joe, C.B.3
  • 76
    • 33750273984 scopus 로고    scopus 로고
    • Evolutionary algorithm for solving multi-objective flow shop scheduling problem
    • Z Wei X-F Xu S-C Deng 2006 Evolutionary algorithm for solving multi-objective flow shop scheduling problem Comput Integrated Manuf Syst 12 1227 1234
    • (2006) Comput Integrated Manuf Syst , vol.12 , pp. 1227-1234
    • Wei, Z.1    Xu X-F2    Deng S-C3
  • 77
    • 27944475064 scopus 로고    scopus 로고
    • Mathematical modeling of multi-objective job shop scheduling with dependent setups and re-entrant operations
    • C Low T-H Wu C-M Hsu 2005 Mathematical modeling of multi-objective job shop scheduling with dependent setups and re-entrant operations Int J Adv Manuf Technol 27 181 189
    • (2005) Int J Adv Manuf Technol , vol.27 , pp. 181-189
    • Low, C.1    Wu T-H2    Hsu C-M3
  • 78
    • 0035781623 scopus 로고    scopus 로고
    • A multi-objective genetic algorithm for job shop scheduling
    • SG Ponnambalam V Ramkumar N Jawahar 2001 A multi-objective genetic algorithm for job shop scheduling Prod Plann Control 12 8 764 774
    • (2001) Prod Plann Control , vol.12 , Issue.8 , pp. 764-774
    • Ponnambalam, S.G.1    Ramkumar, V.2    Jawahar, N.3
  • 79
    • 0000131281 scopus 로고
    • Algorithm for solving production scheduling problems
    • B Giffler GL Thompson 1960 Algorithm for solving production scheduling problems Oper Res 8 487 503
    • (1960) Oper Res , vol.8 , pp. 487-503
    • Giffler, B.1    Thompson, G.L.2
  • 80
    • 0036139058 scopus 로고    scopus 로고
    • Enhanced evolutionary algorithm for single and multi-objective optimization in job shop scheduling problem
    • S Esquivel S Ferrero R Gallard C Salto H Alfonso M Schütz 2002 Enhanced evolutionary algorithm for single and multi-objective optimization in job shop scheduling problem Knowl Syst 15 13 25
    • (2002) Knowl Syst , vol.15 , pp. 13-25
    • Esquivel, S.1    Ferrero, S.2    Gallard, R.3    Salto, C.4    Alfonso, H.5    M. Schütz6
  • 81
    • 32344452455 scopus 로고    scopus 로고
    • Efficient multi-objective evolutionary algorithm for job shop scheduling
    • D Lei Z Wu 2005 Efficient multi-objective evolutionary algorithm for job shop scheduling Chin J Mech Eng 18 4 494 497
    • (2005) Chin J Mech Eng , vol.18 , Issue.4 , pp. 494-497
    • Lei, D.1    Wu, Z.2
  • 82
    • 33746788617 scopus 로고    scopus 로고
    • Crowding-measure-based multi-objective evolutionary for job shop scheduling
    • D Lei Z Wu 2006 Crowding-measure-based multi-objective evolutionary for job shop scheduling Int J Adv Manuf Technol 30 112 117
    • (2006) Int J Adv Manuf Technol , vol.30 , pp. 112-117
    • Lei, D.1    Wu, Z.2
  • 84
    • 34547653934 scopus 로고    scopus 로고
    • Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions
    • D Petrovic A Duenas S Petrovic 2007 Decision support tool for multi-objective job shop scheduling problems with linguistically quantified decision functions Decis Support Syst 43 1527 1538
    • (2007) Decis Support Syst , vol.43 , pp. 1527-1538
    • Petrovic, D.1    Duenas, A.2    Petrovic, S.3
  • 85
    • 33744540562 scopus 로고    scopus 로고
    • Pareto archived simulated annealing for job shop scheduling with multiple objectives
    • RK Suresh KM Mohanasundaram 2006 Pareto archived simulated annealing for job shop scheduling with multiple objectives Int J Adv Manuf Technol 29 184 196
    • (2006) Int J Adv Manuf Technol , vol.29 , pp. 184-196
    • Suresh, R.K.1    Mohanasundaram, K.M.2
  • 86
    • 41449114635 scopus 로고    scopus 로고
    • A Pareto archive particle swarm optimization for multi-objective job shop scheduling
    • D Lei 2008 A Pareto archive particle swarm optimization for multi-objective job shop scheduling Comput Ind Eng 54 960 971
    • (2008) Comput Ind Eng , vol.54 , pp. 960-971
    • Lei, D.1
  • 87
    • 38349135735 scopus 로고    scopus 로고
    • Scheduling multi-objective job shops using a memetic algorithm based on differential evolution
    • B Qian L Wang D-X Huang X Wang 2008 Scheduling multi-objective job shops using a memetic algorithm based on differential evolution Int J Adv Manuf Technol 35 1014 1027
    • (2008) Int J Adv Manuf Technol , vol.35 , pp. 1014-1027
    • Qian, B.1    Wang, L.2    Huang D-X3    Wang, X.4
  • 88
    • 34247615603 scopus 로고    scopus 로고
    • Scheduling of flow-shop, job-shop and combined scheduling problems using MOEAs with fixed and variable length chromosomes
    • MP Kleeman GB Lamont 2007 Scheduling of flow-shop, job-shop and combined scheduling problems using MOEAs with fixed and variable length chromosomes Stud Comput Intell 49 49 99
    • (2007) Stud Comput Intell , vol.49 , pp. 49-99
    • Kleeman, M.P.1    Lamont, G.B.2
  • 89
    • 41749104232 scopus 로고    scopus 로고
    • A tabu search and a genetic algorithm for solving bicriteria general job shop scheduling problem
    • G Vilcot J-C Billaut 2008 A tabu search and a genetic algorithm for solving bicriteria general job shop scheduling problem Eur J Oper Res 190 398 411
    • (2008) Eur J Oper Res , vol.190 , pp. 398-411
    • Vilcot, G.1    Billaut J-C2
  • 91
    • 4944252227 scopus 로고    scopus 로고
    • Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems
    • A Baykasoǧlu L Özbakir A Sönmez 2004 Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems J Intell Manuf 15 777 785
    • (2004) J Intell Manuf , vol.15 , pp. 777-785
    • A. Baykasoǧlu1    L. Özbakir2    A. Sönmez3
  • 92
    • 0033339759 scopus 로고    scopus 로고
    • A taboo search based approach to find the Pareto optimal set in multiple objective optimization
    • A Baykasoǧlu S Owen N Gindy 1999 A taboo search based approach to find the Pareto optimal set in multiple objective optimization J Eng Optim 31 731 748
    • (1999) J Eng Optim , vol.31 , pp. 731-748
    • Baykasoǧlu, A.1    Owen, S.2    Gindy, N.3
  • 93
    • 0036464279 scopus 로고    scopus 로고
    • Approach by localization and multi-objective evolutionary optimization for flexible job shop scheduling problems
    • I Kacem S Hammadi P Borne 2002 Approach by localization and multi-objective evolutionary optimization for flexible job shop scheduling problems IEEE Trans Syst Man Cybern PART C 32 1 1 13
    • (2002) IEEE Trans Syst Man Cybern PART C , vol.32 , Issue.1 , pp. 1-13
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 94
    • 34447289102 scopus 로고    scopus 로고
    • A hybrid of genetic algorithm and bottleneck shifting for multi-objective flexible job shop scheduling problems
    • J Gao M Gen L Sun X Zhao 2007 A hybrid of genetic algorithm and bottleneck shifting for multi-objective flexible job shop scheduling problems Comput Ind Eng 53 149 162
    • (2007) Comput Ind Eng , vol.53 , pp. 149-162
    • Gao, J.1    Gen, M.2    Sun, L.3    Zhao, X.4
  • 95
    • 14044268702 scopus 로고    scopus 로고
    • An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
    • W Xia Z Wu 2005 An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems Comput Ind Eng 48 409 425
    • (2005) Comput Ind Eng , vol.48 , pp. 409-425
    • Xia, W.1    Wu, Z.2
  • 96
    • 67651204552 scopus 로고    scopus 로고
    • Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling
    • (in press)
    • Xing L-N, Chen Y-W, Yang K-W (2008) Multi-objective flexible job shop schedule: design and evaluation by simulation modeling. Appl Soft Comput (in press)
    • (2008) Appl Soft Comput
    • Xing, L.-N.1    Chen, Y.-W.2    Yang, K.-W.3
  • 97
    • 0037201140 scopus 로고    scopus 로고
    • Pareto-Optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic
    • I Kacem S Hammadi P Borne 2002 Pareto-Optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic Math Comput Simul 60 245 276
    • (2002) Math Comput Simul , vol.60 , pp. 245-276
    • Kacem, I.1    Hammadi, S.2    Borne, P.3
  • 98
  • 99
    • 33751381442 scopus 로고    scopus 로고
    • Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems
    • Liu H, Abraham A, Choi O, Moon SH (2006) Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems. Proceedings of SEAL, pp 197-204
    • (2006) Proceedings of SEAL , pp. 197-204
    • Liu, H.1    Abraham, A.2    Choi, O.3    Moon, S.H.4
  • 101
    • 38849162891 scopus 로고    scopus 로고
    • Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
    • JC Tay NB Ho 2008 Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems Comput Ind Eng 54 453 473
    • (2008) Comput Ind Eng , vol.54 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2
  • 102
    • 33845974930 scopus 로고    scopus 로고
    • A multi-objective production scheduling case study solved by simulated annealing
    • T Loukil J Teghem P Fortemps 2007 A multi-objective production scheduling case study solved by simulated annealing Eur J Oper Res 179 709 722
    • (2007) Eur J Oper Res , vol.179 , pp. 709-722
    • Loukil, T.1    Teghem, J.2    Fortemps, P.3
  • 103
    • 0142185333 scopus 로고    scopus 로고
    • A multiobjective genetic algorithm for scheduling a flexible manufacturing systems
    • SS Sankar SG Ponnanbalam 2003 A multiobjective genetic algorithm for scheduling a flexible manufacturing systems Int J Adv Manuf Technol 22 229 236
    • (2003) Int J Adv Manuf Technol , vol.22 , pp. 229-236
    • Sankar, S.S.1    Ponnanbalam, S.G.2
  • 104
    • 0033881797 scopus 로고    scopus 로고
    • Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm
    • M Sakawa R Kubota 2000 Fuzzy programming for multi-objective job shop scheduling with fuzzy processing time and fuzzy due date through genetic algorithm Eur J Oper Res 120 393 407
    • (2000) Eur J Oper Res , vol.120 , pp. 393-407
    • Sakawa, M.1    Kubota, R.2
  • 105
    • 26844467731 scopus 로고    scopus 로고
    • Fuzzy programming for multi-objective fuzzy job shop scheduling with alternative machines through genetic algorithm
    • In: Wang L, Chen K, Ong YS (eds), pp 992-1004
    • Li FM, Zhu YL, Yin CW, Song XY (2005) Fuzzy programming for multi-objective fuzzy job shop scheduling with alternative machines through genetic algorithm. In: Wang L, Chen K, Ong YS (eds) Advance in natural computation. Springer, Berlin, pp 992-1004
    • (2005) Advance In Natural Computation , pp. 992-1004
    • Li, F.M.1    Zhu, Y.L.2    Yin, C.W.3    Song, X.Y.4
  • 106
    • 43249130971 scopus 로고    scopus 로고
    • Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems
    • DM Lei 2008 Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems Int J Adv Manuf Technol 37 157 165
    • (2008) Int J Adv Manuf Technol , vol.37 , pp. 157-165
    • Lei, D.M.1
  • 109
    • 15844383855 scopus 로고    scopus 로고
    • A bi-criteria optimization: minimizing the integral value and spread of the fuzzy makespan of job shop scheduling problems
    • OA Ghrayeb 2003 A bi-criteria optimization: minimizing the integral value and spread of the fuzzy makespan of job shop scheduling problems Appl Soft Comput 2 197 210
    • (2003) Appl Soft Comput , vol.2 , pp. 197-210
    • Ghrayeb, O.A.1


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