메뉴 건너뛰기




Volumn 27, Issue 8, 2014, Pages 1223-1232

Three meta-heuristic algorithms for the single-item capacitated lot-sizing problem

Author keywords

Harmony Search; Lot sizing; Safety stocks; Simulated Annealing; Vibration damping Optimization

Indexed keywords

DAMPING; INTEGER PROGRAMMING; SIMULATED ANNEALING; TAGUCHI METHODS;

EID: 84904671415     PISSN: 1728-144X     EISSN: 17359244     Source Type: Journal    
DOI: 10.5829/idosi.ije.2014.27.08b.08     Document Type: Article
Times cited : (11)

References (25)
  • 1
    • 0001962762 scopus 로고
    • Dynamic version of the economic lot size model
    • Wagner, H.M. and Whitin, T.M., "Dynamic version of the economic lot size model", Management science, Vol. 5, No. 1, (1958), 89-96.
    • (1958) Management Science , vol.5 , Issue.1 , pp. 89-96
    • Wagner, H.M.1    Whitin, T.M.2
  • 2
    • 0033886730 scopus 로고    scopus 로고
    • Improved rolling schedules for the dynamic single-level lot-sizing problem
    • Stadtler, H., "Improved rolling schedules for the dynamic singlelevel lot-sizing problem", Management Science, Vol .46 ,No. 2, (2000), 318-326. (Pubitemid 30594353)
    • (2000) Management Science , vol.46 , Issue.2 , pp. 318-326
    • Stadtler, H.1
  • 3
    • 0037449224 scopus 로고    scopus 로고
    • The single-item lotsizing problem with immediate lost sales
    • Aksen, D., Altinkemer, K. and Chand, S., "The single-item lotsizing problem with immediate lost sales", European Journal of Operational Research, Vol. 147, No. 3, (2003), 558-566.
    • (2003) European Journal of Operational Research , vol.147 , Issue.3 , pp. 558-566
    • Aksen, D.1    Altinkemer, K.2    Chand, S.3
  • 4
    • 84864431343 scopus 로고    scopus 로고
    • Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
    • Akbalik, A. and Rapine, C., "Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost", Operations Research Letters, Vol. 40, No. 5, (2012), 390-397.
    • (2012) Operations Research Letters , vol.40 , Issue.5 , pp. 390-397
    • Akbalik, A.1    Rapine, C.2
  • 5
    • 84876964337 scopus 로고    scopus 로고
    • The single item uncapacitated lotsizing problem with time-dependent batch sizes: Np-hard and polynomial cases
    • Akbalik, A. and Rapine, C., "The single item uncapacitated lotsizing problem with time-dependent batch sizes: Np-hard and polynomial cases", European Journal of Operational Research, Vol. 229, No. 2, (2013), 353-363.
    • (2013) European Journal of Operational Research , vol.229 , Issue.2 , pp. 353-363
    • Akbalik, A.1    Rapine, C.2
  • 7
    • 0033791466 scopus 로고    scopus 로고
    • Optimal price and order size for a reseller under partial backordering
    • Abad, P.L., "Optimal price and order size for a reseller under partial backordering", Computers & Operations Research, Vol. 28, No. 1, (2001), 53-65.
    • (2001) Computers & Operations Research , vol.28 , Issue.1 , pp. 53-65
    • Abad, P.L.1
  • 8
    • 0041511823 scopus 로고    scopus 로고
    • The capacitated lot sizing problem: A review of models and algorithms
    • DOI 10.1016/S0305-0483(03)00059-8, PII S0305048303000598
    • Karimi, B., Fatemi Ghomi, S .and Wilson, J., "The capacitated lot sizing problem: A review of models and algorithms", Omega, Vol. 31, No. 5, (2003), 365-378. (Pubitemid 37007074)
    • (2003) Omega , vol.31 , Issue.5 , pp. 365-378
    • Karimi, B.1    Fatemi Ghomi, S.M.T.2    Wilson, J.M.3
  • 9
    • 0242662607 scopus 로고    scopus 로고
    • A memetic algorithm for a multistage capacitated lot-sizing problem
    • Berretta, R. and Rodrigues, L.F., "A memetic algorithm for a multistage capacitated lot-sizing problem", International Journal of Production Economics, Vol. 87, No. 1, (2004), 67-81.
    • (2004) International Journal of Production Economics , vol.87 , Issue.1 , pp. 67-81
    • Berretta, R.1    Rodrigues, L.F.2
  • 11
    • 44949142877 scopus 로고    scopus 로고
    • Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms
    • Robinson, P ,.Narayanan, A. and Sahin, F., "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms", Omega, Vol. 37, No. 1, (2009), 3-15.
    • (2009) Omega , vol.37 , Issue.1 , pp. 3-15
    • Robinson, P.1    Narayanan, A.2    Sahin, F.3
  • 12
    • 67349282740 scopus 로고    scopus 로고
    • Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs
    • Akbalik, A. and Penz, B., "Exact methods for single-item capacitated lot sizing problem with alternative machines and piece-wise linear production costs", International Journal of Production Economics, Vol. 119, No. 2, (2009), 367-379.
    • (2009) International Journal of Production Economics , vol.119 , Issue.2 , pp. 367-379
    • Akbalik, A.1    Penz, B.2
  • 13
    • 63349096024 scopus 로고    scopus 로고
    • Valid inequalities for the singleitem capacitated lot sizing problem with step-wise costs
    • Akbalik, A. and Pochet, Y., "Valid inequalities for the singleitem capacitated lot sizing problem with step-wise costs", European Journal of Operational Research, Vol. 198, No. 2, (2009), 412-434.
    • (2009) European Journal of Operational Research , vol.198 , Issue.2 , pp. 412-434
    • Akbalik, A.1    Pochet, Y.2
  • 14
    • 84055177513 scopus 로고    scopus 로고
    • A single-item uncapacitated lot-sizing problem with remanufacturing and outsourcing
    • Wang, N., He, Z., Sun, J., Xie, H. and Shi, W., "A single-item uncapacitated lot-sizing problem with remanufacturing and outsourcing", Procedia Engineering, Vol. 15, No., (2011), 5170-5178.
    • (2011) Procedia Engineering , vol.15 , pp. 5170-5178
    • Wang, N.1    He, Z.2    Sun, J.3    Xie, H.4    Shi, W.5
  • 15
    • 84904668088 scopus 로고    scopus 로고
    • An algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging
    • ahead-of-print
    • Kovalyov, M.Y. and Pesch, E., "An algorithm for a single-item capacitated lot-sizing problem with linear costs and no backlogging", International Journal of Production Research, Vol., No. ahead-of-print, (2013) 4-1.
    • (2013) International Journal of Production Research , pp. 4-1
    • Kovalyov, M.Y.1    Pesch, E.2
  • 16
    • 1342328090 scopus 로고    scopus 로고
    • Simulated annealing in lot sizing problems
    • Tang, O., "Simulated annealing in lot sizing problems", International Journal of Production Economics, Vol. 88, No. 2, (2004), 173-181.
    • (2004) International Journal of Production Economics , vol.88 , Issue.2 , pp. 173-181
    • Tang, O.1
  • 18
    • 67649989828 scopus 로고    scopus 로고
    • Finite horizon economic lot and delivery scheduling problem: Flexible flow lines with unrelated parallel machines and sequence dependent setups
    • Jenabi, M., Ghomi, S.F. and Torabi, S., "Finite horizon economic lot and delivery scheduling problem: Flexible flow lines with unrelated parallel machines and sequence dependent setups", International Journal of Engineering, Vol. 21, (2008), 143-158.
    • (2008) International Journal of Engineering , vol.21 , pp. 143-158
    • Jenabi, M.1    Ghomi, S.F.2    Torabi, S.3
  • 19
    • 81555198352 scopus 로고    scopus 로고
    • Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
    • Piperagkas, G.S., Konstantaras, I., Skouri, K. and Parsopoulos, K.E., "Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics", Computers & Operations Research, Vol. 39, No. 7, (2012), 1555-1565.
    • (2012) Computers & Operations Research , vol.39 , Issue.7 , pp. 1555-1565
    • Piperagkas, G.S.1    Konstantaras, I.2    Skouri, K.3    Parsopoulos, K.E.4
  • 20
    • 84869109657 scopus 로고    scopus 로고
    • A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory
    • Chu, C., Chu, F., Zhong, J. and Yang, S., "A polynomial algorithm for a lot-sizing problem with backlogging, outsourcing and limited inventory", Computers & Industrial Engineering, Vol. 64, No. 1, (2013), 200-210.
    • (2013) Computers & Industrial Engineering , vol.64 , Issue.1 , pp. 200-210
    • Chu, C.1    Chu, F.2    Zhong, J.3    Yang, S.4
  • 21
    • 0000728412 scopus 로고
    • Optimization using simulated annealing
    • Brooks, S. and Morgan, B., "Optimization using simulated annealing", The Statistician, Vol., No., (1995), 241-257.
    • (1995) The Statistician , pp. 241-257
    • Brooks, S.1    Morgan, B.2
  • 23
    • 0034974417 scopus 로고    scopus 로고
    • A new heuristic optimization algorithm: Harmony search
    • Geem, Z.W., Kim, J.H. and Loganathan, G., "A new heuristic optimization algorithm: Harmony search", Simulation, Vol. 76, No. 2, (2001), 60-68. (Pubitemid 32543074)
    • (2001) Simulation , vol.76 , Issue.2 , pp. 60-68
    • Geem, Z.W.1    Kim, J.H.2    Loganathan, G.V.3
  • 24
    • 84864927288 scopus 로고    scopus 로고
    • An intelligent tuned harmony search algorithm for optimisation
    • Yadav, P., Kumar, R., Panda, S.K. and Chang, C., "An intelligent tuned harmony search algorithm for optimisation", Information Sciences, Vol. 196, No., (2012), 47-72.
    • (2012) Information Sciences , vol.196 , pp. 47-72
    • Yadav, P.1    Kumar, R.2    Panda, S.K.3    Chang, C.4


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