A polynomial algorithm for the production/ordering planning problem with limited storage

Computers and Operations Research

Volumn 34, Issue 4, 2007, Pages 934-937

  Gutierrez J ^a   Sedeno Noda A ^a   Colebrook, M ^a   Sicilia, J ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Capacity; Dynamic programming; Inventory production: Policies

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; FUNCTIONS; PLANNING; POLYNOMIALS;

CONCAVE FUNCTIONS; INVENTORY-PRODUCTION: POLICIES; POLYNOMIAL ALGORITHM; PRODUCTION/ORDERING PLANNING PROBLEM;

OPERATIONS RESEARCH;

EID: 33748757063     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.05.029     Document Type: Article

References (2)

1. Love S.F. Bounded production and inventory models with piecewise concave costs. Management Science 20 (1973) 313-318
2. Gutiérrez J., Sedeño-Noda A., Colebrook M., and Sicilia J. A new characterization for the dynamic lot size problem with bounded inventory. Computers & Operations Research 30 (2003) 383-395