메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1777-1781

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem

Author keywords

Genetic algorithms; Lot sizing; Multi population; Scheduling; Soft drink company

Indexed keywords

BEVERAGES; BINARY TREES; COMPUTATIONAL METHODS; DIESEL ENGINES; GENETIC ALGORITHMS; SCHEDULING;

EID: 56749169614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1363686.1364114     Document Type: Conference Paper
Times cited : (3)

References (11)
  • 1
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • Bitran, G. R. and Yanasse, H.H. 1982. Computational complexity of the capacitated lot size problem. Management Science 28 (10), 1174-1186.
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.R.1    Yanasse, H.H.2
  • 2
    • 6944232635 scopus 로고    scopus 로고
    • A new memetic algorithm for the asymmetric traveling salesman problem
    • Buriol, L.; França, P.M.; Moscato, P. 2004. A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics 10, pp. 483-506.
    • (2004) Journal of Heuristics , vol.10 , pp. 483-506
    • Buriol, L.1    França, P.M.2    Moscato, P.3
  • 3
    • 0002577952 scopus 로고
    • Analysis of relaxations for the multi-item capacitated lot-sizing problem
    • Chen, W.H. and Thizy, J.M. 1990. Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annals of Operations Research 26, 29-72.
    • (1990) Annals of Operations Research , vol.26 , pp. 29-72
    • Chen, W.H.1    Thizy, J.M.2
  • 4
    • 0035401193 scopus 로고    scopus 로고
    • A memetic algorithm for the total tardiness single machine scheduling problem
    • França, P.M.; Mendes, A.S.; Moscato, P. 2001. A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 1(132), 224-242.
    • (2001) European Journal of Operational Research , vol.1 , Issue.132 , pp. 224-242
    • França, P.M.1    Mendes, A.S.2    Moscato, P.3
  • 5
    • 84870965272 scopus 로고    scopus 로고
    • GAMS
    • GAMS : Web site. http://www.gams.com.
    • Web site
  • 8
    • 33750728882 scopus 로고    scopus 로고
    • Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
    • Jans, R. and Degraeve, Z. 2007. Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research, 177, 1855-1875.
    • (2007) European Journal of Operational Research , vol.177 , pp. 1855-1875
    • Jans, R.1    Degraeve, Z.2
  • 10
    • 56749144946 scopus 로고    scopus 로고
    • Toledo, C.F.M.; Kimms, A.; França, P.M; Morabito, R. 2007. A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem, Journal of Operational Research Society: under review.
    • Toledo, C.F.M.; Kimms, A.; França, P.M; Morabito, R. 2007. A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem, Journal of Operational Research Society: under review.
  • 11
    • 50549091331 scopus 로고    scopus 로고
    • A multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
    • to appear
    • Toledo, C.F.M.; França, P.M; Morabito, R.; Kimms, A. 2007. A multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem, International Journal of Production Research: to appear.
    • (2007) International Journal of Production Research
    • Toledo, C.F.M.1    França, P.M.2    Morabito, R.3    Kimms, A.4


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