The Linear Dynamic Lot Size Problem with Minimum Order Quantities
Juniorprofessur:
Juniorprofessur in Information & Operations Management
Projekttitel:
The Linear Dynamic Lot Size Problem with Minimum Order Quantities
Projektleitung:
Prof. Dr. Dr. h. c. Knut Richter
Projektart: Lehrstuhlprojekt
Finanzierung: Eigenfinanzierung EUV
Projektbeginn: 01.01.2008
Projektende: 30.06.2011
Projektbeschreibung in englisch:
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allowed us to develop a solution algorithm based on the concept of minimal sub-problems. We present an optimal solution to a minimal sub-problem in an explicit form and prove that it serves as a construction block for the optimal solution of the initial problem. The computational tests and the comparison with the published algorithm confirm the efficiency of the solution algorithm developed here.
Publikationen:
The linear dynamic lot size problem with minimum order quantities, International Journal of Production Economics 133, 688--693, 2011 (mit K. Richter).
The linear dynamic lot size problem with minimum order quantities, Working Paper 283, European University Viadrina Frankfurt (Oder), 2010, ISSN: 1860 0921 (mit K. Richter).
The single item dynamic lot-sizing problem with minimum lot size restriction, in: B. Fleischmann et al. (eds.) Operations Research Proceedings 2008, Springer, Berlin, 91--96, 2009 (mit K. Richter).