AN EFFICIENT ALGORITHM FOR THE DYNAMIC ECONOMIC LOT SIZE PROBLEM

被引：2

作者：

GOLANY, B ^{[1
]}

MAMAN, R ^{[1
]}

YADIN, M ^{[1
]}

机构：

[1] SHELL INT RES MAATSCHAPPIJ BV,DEPT MATH & SYST ENGN,KONINKLIJKE SHELL LAB AMSTERDAM,AMSTERDAM,NETHERLANDS

来源：

COMPUTERS & OPERATIONS RESEARCH | 1992年 / 19卷 / 06期

关键词：

D O I：

10.1016/0305-0548(92)90004-O

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper addresses the question of production/procurement planning for finite horizon, deterministic, dynamic demand process, known as the "Dynamic Economic Lot size Problem". A new algorithm is presented and compared to existing exact procedures. The algorithm first decomposes the problem into much smaller sequences (planning horizons). It then applies an exact method to schedule the production in each sequence (this stage is illustrated here with the "classical" dynamic programming algorithm of Zangwill [8]). Finally, it combines the partial solutions to an overall optimal solution. Computational results which demonstrate the effectiveness of the proposed algorithm are provided.

引用

页码：495 / 504

页数：10

共 8 条

[1]

AGGARWAL A, 1990, UNPUB IMPROVED ALGOR

[2]

[Anonymous], 2012, DYNAMIC PROGRAMMING

[3] A SIMPLE FORWARD ALGORITHM TO SOLVE GENERAL DYNAMIC LOT SIZING MODELS WITH N PERIODS IN 0(N LOG N) OR 0(N) TIME [J].