메뉴 건너뛰기




Volumn 47, Issue 11, 2009, Pages 3097-3119

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

Author keywords

Combinatorial optimization; Genetic algorithm; Lot sizing and scheduling; Production planning; Soft drink manufacturing

Indexed keywords

LOT SIZING; LOT-SIZING AND SCHEDULING; PRODUCTION PLANNING; SOFT DRINKS;

EID: 68949180552     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701675833     Document Type: Article
Times cited : (74)

References (32)
  • 1
    • 22744442994 scopus 로고    scopus 로고
    • Metaheuristic approaches for the multilevel resource-constrained lot-sizing problem with setup and lead times
    • Berreta, R.E., França, P.M. and Armentano, V.A., 2005. Metaheuristic approaches for the multilevel resource-constrained lot-sizing problem with setup and lead times. Asia-Pacific Journal of Operational Research, 22 (2), 261-286.
    • (2005) Asia-Pacific Journal of Operational Research , vol.22 , Issue.2 , pp. 261-286
    • Berreta, R.E.1    França, P.M.2    Armentano, V.A.3
  • 2
    • 0022581408 scopus 로고
    • Approximation formulations for the single-product capacitated lot size problem
    • Bitran, G.R. and Matsuo, H., 1986. Approximation formulations for the single-product capacitated lot size problem. Operations Research, 34, 63-74.
    • (1986) Operations Research , vol.34 , pp. 63-74
    • Bitran, G.R.1    Matsuo, H.2
  • 3
    • 0346724484 scopus 로고    scopus 로고
    • Hybrid heuristics for planning lot setups and sizes
    • Clark, A.R., 2003. Hybrid heuristics for planning lot setups and sizes. Computers and Industrial Engineering, 45 (4), 545-562.
    • (2003) Computers and Industrial Engineering , vol.45 , Issue.4 , pp. 545-562
    • Clark, A.R.1
  • 4
    • 0034631279 scopus 로고    scopus 로고
    • Rolling-horizon lot-sizing when set-up times are sequencedependent
    • Clark, A.R. and Clark, S.J., 2000. Rolling-horizon lot-sizing when set-up times are sequencedependent. International Journal of Production Research, 38 (10), 2287-2307.
    • (2000) International Journal of Production Research , vol.38 , Issue.10 , pp. 2287-2307
    • Clark, A.R.1    Clark, S.J.2
  • 5
    • 0034501331 scopus 로고    scopus 로고
    • A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs
    • Dellaert, N., Jeunet, J. and Jonard, N., 2000. A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. International Journal of Production Economics, 68, 241-257.
    • (2000) International Journal of Production Economics , vol.68 , pp. 241-257
    • Dellaert, N.1    Jeunet, J.2    Jonard, N.3
  • 6
    • 0029215084 scopus 로고
    • Evolution based learning in job shop scheduling enviroment
    • Dorndorf, U. and Pesch, E., 1995. Evolution based learning in job shop scheduling enviroment. Computer & Operations Research, 22, 25-40.
    • (1995) Computer & Operations Research , vol.22 , pp. 25-40
    • Dorndorf, U.1    Pesch, E.2
  • 7
    • 0031170482 scopus 로고    scopus 로고
    • Lot-sizing and scheduling - Survey and extensions
    • 1997
    • Drexl, A., 1997. Kimms, A., 1997. Lot-sizing and scheduling - survey and extensions. European Journal of Operational Research, 99, 221-235.
    • (1997) European Journal of Operational Research , vol.99 , pp. 221-235
    • Drexl, A.1    Kimms, A.2
  • 8
    • 0028769382 scopus 로고
    • The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
    • Fleischmann, B., 1994. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. European Journal of Operational Research, 75, 395-404.
    • (1994) European Journal of Operational Research , vol.75 , pp. 395-404
    • Fleischmann, B.1
  • 9
    • 0008655177 scopus 로고    scopus 로고
    • The general lot-sizing and scheduling problem
    • Fleischmann, B. and Meyr, H., 1997. The general lot-sizing and scheduling problem. OR Spektrum, 19, 11-21.
    • (1997) OR Spektrum , vol.19 , pp. 11-21
    • Fleischmann, B.1    Meyr, H.2
  • 11
    • 0035401193 scopus 로고    scopus 로고
    • A memetic algorithm for the total tardiness single machine scheduling problem
    • França, P.M., Mendes, A.S. and 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
  • 12
    • 70449687396 scopus 로고    scopus 로고
    • Web site. Available from (Accessed 11 May, 2007)
    • Gams, Web site. Available from: http://www.gams.com (Accessed 11 May, 2007).
  • 14
    • 5644274147 scopus 로고    scopus 로고
    • The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
    • Gupta, D. and Magnusson, T., 2005. The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers & Operations Research, 32, 727-747.
    • (2005) Computers & Operations Research , vol.32 , pp. 727-747
    • Gupta, D.1    Magnusson, T.2
  • 15
    • 0033690423 scopus 로고    scopus 로고
    • Lot-sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities
    • Haase, K. and Kimms, A., 2000. Lot-sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159-169.
    • (2000) International Journal of Production Economics , vol.66 , pp. 159-169
    • Haase, K.1    Kimms, A.2
  • 16
    • 0026125207 scopus 로고
    • Improving LP-representations of zero-one linear programs for branch-and-cut
    • Hoffman, K.L. and Padberg, M., 1991. Improving LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal of Computing, 3 (2), 121-134.
    • (1991) ORSA Journal of Computing , vol.3 , Issue.2 , pp. 121-134
    • Hoffman, K.L.1    Padberg, M.2
  • 17
    • 0003463297 scopus 로고
    • Cambridge: The University of Michigan Press. Java Sun, Web site. Available from: (Accessed 11 May 2007)
    • Holland, J.H., 1975. Adaptation in natural and artificial systems. Cambridge: The University of Michigan Press. Java Sun, Web site. Available from: http://java.sun.com (Accessed 11 May 2007).
    • (1975) Adaptation in Natural and Artificial Systems
    • Holland, J.H.1
  • 18
    • 0032652235 scopus 로고    scopus 로고
    • Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
    • Kang, S., Malik, K. and Thomas, L.J., 1999. Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science, 45, 273-289.
    • (1999) Management Science , vol.45 , pp. 273-289
    • Kang, S.1    Malik, K.2    Thomas, L.J.3
  • 19
    • 0041511823 scopus 로고    scopus 로고
    • The capacitated lot sizing problem: A review of models and algorithms
    • Karimi, B., Ghomi Fatemi, S.M.T. and Wilson, J.M., 2003. The capacitated lot sizing problem: A review of models and algorithms. Omega, 31, 365-378.
    • (2003) Omega , vol.31 , pp. 365-378
    • Karimi, B.1    Ghomi Fatemi, S.M.T.2    Wilson, J.M.3
  • 21
    • 0033166857 scopus 로고    scopus 로고
    • A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
    • Kimms, A., 1999. A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Computers & Operations Research, 26, 829-848.
    • (1999) Computers & Operations Research , vol.26 , pp. 829-848
    • Kimms, A.1
  • 25
    • 0033903519 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
    • Meyr, H., 2000. Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research, 120, 311-326.
    • (2000) European Journal of Operational Research , vol.120 , pp. 311-326
    • Meyr, H.1
  • 26
    • 0036604813 scopus 로고    scopus 로고
    • Simultaneous lotsizing and scheduling on parallel machines
    • Meyr, H., 2002. Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139, 277-292.
    • (2002) European Journal of Operational Research , vol.139 , pp. 277-292
    • Meyr, H.1
  • 28
    • 0032210423 scopus 로고    scopus 로고
    • Hybrid heuristic for the capacitated lot sizing and loading problem with setup times and overtime decisions
    • Özdamar, L. and Birbil, S.I., 1998. Hybrid heuristic for the capacitated lot sizing and loading problem with setup times and overtime decisions. European Journal of Operational Research, 110, 525-547.
    • (1998) European Journal of Operational Research , vol.110 , pp. 525-547
    • Özdamar, L.1    Birbil, S.I.2
  • 29
    • 0030241588 scopus 로고    scopus 로고
    • A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line
    • DOI 10.1016/0360-8352(96)00046-0
    • Sikora, R., 1996. A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. Computers & Industrial Engineering, 30 (4), 969-981. (Pubitemid 126375907)
    • (1996) Computers and Industrial Engineering , vol.30 , Issue.4 , pp. 969-981
    • Sikora, R.1
  • 31
    • 47149097593 scopus 로고    scopus 로고
    • A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem
    • in press
    • Toledo, C.F.M., Kimms, A., França, P.M., and Morabito, R., 2006. A mathematical model for the synchronized and integrated two-level lot sizing and scheduling problem. Journal of Operational Research Society, in press.
    • (2006) Journal of Operational Research Society
    • Toledo, C.F.M.1    Kimms, A.2    França, P.M.3    Morabito, R.4


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