메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 417-420

Solution to multi-objective optimization of flow shop problem based on ACO algorithm

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; LARGE SCALE SYSTEMS; MULTIOBJECTIVE OPTIMIZATION; PROBLEM SOLVING;

EID: 38549086270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCIAS.2006.294166     Document Type: Conference Paper
Times cited : (6)

References (9)
  • 1
    • 0003075019 scopus 로고
    • Optimal two-and three-stage production schedules
    • S.M. Johnson, Optimal two-and three-stage production schedules, Naval Research Logistics Quarterly 1, 1954, pp. 61-68.
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 61-68
    • Johnson, S.M.1
  • 2
    • 38549086716 scopus 로고    scopus 로고
    • Simulated Annealing Solutions for Multi-Objective Scheduling and Timetabling, in Rayward-Smith V.J., Osman I.H., Reeves C.R., Smith G.D. (Eds.), Modern Heuristic Search Methods, JoIm Wiley & Sons, 1996.
    • Simulated Annealing Solutions for Multi-Objective Scheduling and Timetabling, in Rayward-Smith V.J., Osman I.H., Reeves C.R., Smith G.D. (Eds.), Modern Heuristic Search Methods, JoIm Wiley & Sons, 1996.
  • 3
    • 0028766745 scopus 로고
    • A Tabu Search Algorithm for Computing an Operational Timetable
    • C.Daniel, "A Tabu Search Algorithm for Computing an Operational Timetable", European Journal of Operational Research, Vol. 76, 1994, pp. 98-110.
    • (1994) European Journal of Operational Research , vol.76 , pp. 98-110
    • Daniel, C.1
  • 5
    • 0037120688 scopus 로고    scopus 로고
    • An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
    • V. T'kindt, N. Monmarché, F. Tercinet and D. Laügt, "An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem", European Journal of Opera-tional Research, 142(2), 2002, pp. 250-257.
    • (2002) European Journal of Opera-tional Research , vol.142 , Issue.2 , pp. 250-257
    • T'kindt, V.1    Monmarché, N.2    Tercinet, F.3    Laügt, D.4
  • 6
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • M. Dorigo, G. Di Caro and L.M. Gambardella, "Ant algorithms for discrete optimization", Ar-tificial Life, 5(3) 1999, pp. 137-172.
    • (1999) Ar-tificial Life , vol.5 , Issue.3 , pp. 137-172
    • Dorigo, M.1    Di Caro, G.2    Gambardella, L.M.3
  • 7
    • 0004061426 scopus 로고
    • Positive feedback as a search strategy
    • Technical Report, No. 91-016, Politécnico di Milano, Italy
    • A. Colorni, M. Dorigo, and V. Maniezzo, "Positive feedback as a search strategy", Technical Report, No. 91-016, Politécnico di Milano, Italy, 1991.
    • (1991)
    • Colorni, A.1    Dorigo, M.2    Maniezzo, V.3
  • 8
    • 0036604814 scopus 로고    scopus 로고
    • An improved branch-and-bound algorithm for the two-machine total completion time flow shop problem
    • F. Della Croce, M. Ghirardi and R. Tadei, "An improved branch-and-bound algorithm for the two-machine total completion time flow shop problem", European Journal of Operational Re-search, 139(2), 2002, pp. 293-301.
    • (2002) European Journal of Operational Re-search , vol.139 , Issue.2 , pp. 293-301
    • Della Croce, F.1    Ghirardi, M.2    Tadei, R.3
  • 9
    • 0002619627 scopus 로고
    • Two-machine flowshop scheduling to minimize mean flow time
    • B.W. Cadambi and Y.S. Sathe, "Two-machine flowshop scheduling to minimize mean flow time", Opsearch, 30(1), 1993,pp.35-41.
    • (1993) Opsearch , vol.30 , Issue.1 , pp. 35-41
    • Cadambi, B.W.1    Sathe, Y.S.2


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