Keywords: heuristics; lot-sizing; dynamic pricing; specialized algorithm for LP's
@article{KYB_2010_46_3_a6,
author = {Haugen, Kjetil K. and Olstad, Asmund and Bakhrankova, Krystsina and Van Eikenhorst, Erik},
title = {The single (and multi) item profit maximizing capacitated lot{\textendash}size {(PCLSP)} problem with fixed prices and no set{\textendash}up},
journal = {Kybernetika},
pages = {415--422},
year = {2010},
volume = {46},
number = {3},
mrnumber = {2676079},
zbl = {1198.90123},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a6/}
}
TY - JOUR AU - Haugen, Kjetil K. AU - Olstad, Asmund AU - Bakhrankova, Krystsina AU - Van Eikenhorst, Erik TI - The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up JO - Kybernetika PY - 2010 SP - 415 EP - 422 VL - 46 IS - 3 UR - http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a6/ LA - en ID - KYB_2010_46_3_a6 ER -
%0 Journal Article %A Haugen, Kjetil K. %A Olstad, Asmund %A Bakhrankova, Krystsina %A Van Eikenhorst, Erik %T The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up %J Kybernetika %D 2010 %P 415-422 %V 46 %N 3 %U http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a6/ %G en %F KYB_2010_46_3_a6
Haugen, Kjetil K.; Olstad, Asmund; Bakhrankova, Krystsina; Van Eikenhorst, Erik. The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up. Kybernetika, Tome 46 (2010) no. 3, pp. 415-422. http://geodesic.mathdoc.fr/item/KYB_2010_46_3_a6/
[1] Belvaux, G., Wolsey, L. A.: Lotsizelib: A Library of Models and Matrices for Lot-sizing Problems. Internal Report, Universite Catholique de Louvain, Center for Operations Research and Econometrics, 1999.
[2] Diaby, M., Bahl, H. C., Karwan, M. H., Zionts, S.: A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. 38 (1992), 9, 1329–1340. | DOI | Zbl
[3] Drexl, A., Kimms, A.: Lot sizing and scheduling – survey and extensions. European J. Oper. Res. 99 (1997), 221–235. | DOI | Zbl
[4] Florian, M., Lenstra, J. K., Kan, A. H. G Rinnooy: Deterministic production planning: algorithms and complexity. Management Sci. 26 (1980), 669–679. | DOI | MR
[5] Haugen, K. K., Olstad, A., Pettersen, B. I.: The profit maximizing capacitated lot-size (pclsp) problem. European J. Oper. Res. 176 (2007), 165–176. | DOI | MR | Zbl
[6] Haugen, K. K, Olstad, A., Pettersen, B. I.: Solving large-scale profit maximization capacitated lot-size problems by heuristic methods. J. Math. Modelling and Algorithms 6 (2007), 1, 135–149. | DOI | MR | Zbl
[7] Nahmias, S.: Production and Operations Analysis. Fifth edition. McGraw Hill, Boston 2005.
[8] Olstad, A.: Dynamic Pricing and Lot-sizing Within Manufacturing. PhD Thesis, Norwegian School of Economics and Business Administration 2006.
[9] Thizy, J. M., Wassenhove, L. N. Van: Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IEE Trans. 17 (1985), 4, 308–313. | DOI
[10] Thomas, J.: Price-production decisions with deterministic demand. Management Sci. 18 (1970), 11, 747–750. | DOI | Zbl
[11] Trigeiro, W. W., Thomas, L. J., McClain, J. O.: Capacitated lot sizing with setup times. Management Sci. 35 (1989), 3, 353–366. | DOI
[12] Wagner, H. M., Whitin, T. M.: Dynamic version of the economic lot size model. Management Sci. 5 (1958), 3, 89–96. | DOI | MR | Zbl