Previous |  Up |  Next

Article

Title: The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up (English)
Author: Haugen, Kjetil K.
Author: Olstad, Asmund
Author: Bakhrankova, Krystsina
Author: Van Eikenhorst, Erik
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 46
Issue: 3
Year: 2010
Pages: 415-422
Summary lang: English
.
Category: math
.
Summary: This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves. (English)
Keyword: heuristics
Keyword: lot-sizing
Keyword: dynamic pricing
Keyword: specialized algorithm for LP's
MSC: 65K05
MSC: 68W99
MSC: 90B05
MSC: 90B06
MSC: 90B30
MSC: 90C05
MSC: 90C59
MSC: 91B24
idZBL: Zbl 1198.90123
idMR: MR2676079
.
Date available: 2010-09-13T16:50:11Z
Last updated: 2013-09-21
Stable URL: http://hdl.handle.net/10338.dmlcz/140757
.
Reference: [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.
Reference: [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. Zbl 0758.90020, 10.1287/mnsc.38.9.1329
Reference: [3] Drexl, A., Kimms, A.: Lot sizing and scheduling – survey and extensions.European J. Oper. Res. 99 (1997), 221–235. Zbl 0923.90067, 10.1016/S0377-2217(97)00030-1
Reference: [4] Florian, M., Lenstra, J. K., Kan, A. H. G Rinnooy: Deterministic production planning: algorithms and complexity.Management Sci. 26 (1980), 669–679. MR 0591292, 10.1287/mnsc.26.7.669
Reference: [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. Zbl 1137.90619, MR 2265141, 10.1016/j.ejor.2005.08.001
Reference: [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. Zbl 1143.90003, MR 2284077, 10.1007/s10852-006-9053-2
Reference: [7] Nahmias, S.: Production and Operations Analysis.Fifth edition. McGraw Hill, Boston 2005.
Reference: [8] Olstad, A.: Dynamic Pricing and Lot-sizing Within Manufacturing.PhD Thesis, Norwegian School of Economics and Business Administration 2006.
Reference: [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. 10.1080/07408178508975308
Reference: [10] Thomas, J.: Price-production decisions with deterministic demand.Management Sci. 18 (1970), 11, 747–750. Zbl 0197.46401, 10.1287/mnsc.16.11.747
Reference: [11] Trigeiro, W. W., Thomas, L. J., McClain, J. O.: Capacitated lot sizing with setup times.Management Sci. 35 (1989), 3, 353–366. 10.1287/mnsc.35.3.353
Reference: [12] Wagner, H. M., Whitin, T. M.: Dynamic version of the economic lot size model.Management Sci. 5 (1958), 3, 89–96. Zbl 0977.90500, MR 0102442, 10.1287/mnsc.5.1.89
.

Files

Files Size Format View
Kybernetika_46-2010-3_7.pdf 428.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo