메뉴 건너뛰기




Volumn , Issue , 2008, Pages 1384-1391

Meta-heuristic approaches for a soft drink industry problem

Author keywords

[No Author keywords available]

Indexed keywords

AND GENETIC ALGORITHMS; COMPUTATIONAL RESULTS; HEURISTIC APPROACHES; IN LINES; LOT SIZINGS; REAL SITUATIONS; SOFT DRINKS; THRESHOLD ACCEPTING;

EID: 56349167064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2008.4638579     Document Type: Conference Paper
Times cited : (2)

References (13)
  • 1
    • 33750728882 scopus 로고    scopus 로고
    • R. Jans, Z. Degraeve Z., Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches, European Journal of Operational Research, 177, pp. 1855-1875, 2007.
    • R. Jans, Z. Degraeve Z., "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches", European Journal of Operational Research, Vol. 177, pp. 1855-1875, 2007.
  • 4
    • 0035382004 scopus 로고    scopus 로고
    • A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover
    • M. Gopalakrishnan, K. Ding, J. M. Bourjolly, S. Mohan, "A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover", Management Science, Vol. 47 (6), pp. 851-863, 2001.
    • (2001) Management Science , vol.47 , Issue.6 , pp. 851-863
    • Gopalakrishnan, M.1    Ding, K.2    Bourjolly, J.M.3    Mohan, S.4
  • 5
    • 0346093875 scopus 로고    scopus 로고
    • Using tabu search with ranking candidate list to solve production planning problems with setups
    • Y. F. Hung, C. P. Chen, C.C. Shih, M. H. Hung, "Using tabu search with ranking candidate list to solve production planning problems with setups", Computers & Industrial Engineering, Vol. 45, pp. 615-634, 2003.
    • (2003) Computers & Industrial Engineering , vol.45 , pp. 615-634
    • Hung, Y.F.1    Chen, C.P.2    Shih, C.C.3    Hung, M.H.4
  • 6
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • H. Meyr, "Simultaneous lotsizing and scheduling on parallel machines", European Journal of Operational Research, Vol. 139, pp. 277-292, 2002.
    • (2002) European Journal of Operational Research , vol.139 , pp. 277-292
    • Meyr, H.1
  • 7
    • 0020194024 scopus 로고
    • Computational complexity of the capacitated lot size problem
    • G. R. Bitran, H. H. Yanasse, "Computational complexity of the capacitated lot size problem", Management Science, Vol. 28 (10), pp. 1174-1186, 1982.
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1174-1186
    • Bitran, G.R.1    Yanasse, H.H.2
  • 8
    • 0041511823 scopus 로고    scopus 로고
    • The capacitated lot sizing problem: A review of models and algorithms
    • B. Karimi, S. M. T. Ghomi Fatemi, J. M Wilson, "The capacitated lot sizing problem: a review of models and algorithms", Omega, Vol. 31, pp. 365-378, 2003.
    • (2003) Omega , vol.31 , pp. 365-378
    • Karimi, B.1    Ghomi Fatemi, S.M.T.2    Wilson, J.M.3
  • 10
    • 84890791547 scopus 로고    scopus 로고
    • A Multi-Population Genetic Algorithm to Solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem
    • to appear
    • C. F. M. Toledo, A. Kimms, P. M. França, R. Morabito, "A Multi-Population Genetic Algorithm to Solve the Synchronized and Integrated Two-Level Lot Sizing and Scheduling Problem", International Journal of Operation Research: to appear.
    • International Journal of Operation Research
    • Toledo, C.F.M.1    Kimms, A.2    França, P.M.3    Morabito, R.4
  • 11
    • 0035401193 scopus 로고    scopus 로고
    • A memetic algorithm for the total tardiness single machine scheduling problem
    • P. M. França, A. S. Mendes, P. Moscato, "A memetic algorithm for the total tardiness single machine scheduling problem", European Journal of Operational Research, Vol. 1(132), pp. 224-242, 2001.
    • (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
  • 12
    • 6944232635 scopus 로고    scopus 로고
    • A new memetic algorithm for the asymmetric traveling salesman problem
    • L. Buriol, P. M. França, P. Moscato, "A new memetic algorithm for the asymmetric traveling salesman problem", Journal of Heuristics, Vol. 10, pp. 483-506, 2004.
    • (2004) Journal of Heuristics , vol.10 , pp. 483-506
    • Buriol, L.1    França, P.M.2    Moscato, P.3
  • 13
    • 0032652235 scopus 로고    scopus 로고
    • Lotsizing and scheduling on parallel machines with sequencedependent setup costs
    • S. Kang, K. Malik, L. J. Thomas, "Lotsizing and scheduling on parallel machines with sequencedependent setup costs", Management Science, Vol. 45 (2), pp. 273-289, 1999.
    • (1999) Management Science , vol.45 , Issue.2 , pp. 273-289
    • Kang, S.1    Malik, K.2    Thomas, L.J.3


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