An efficient integer programming model of the dynamic lot-sizing problem

DOI10.1080/00207729408929000zbMATH Open0799.90046OpenAlexW2029292653MaRDI QIDQ4298947FDOQ4298947

Authors: Chao-Hsien Pan, Ching-Jong Liao 

Publication date: 21 July 1994

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729408929000

Recommendations

• An efficient algorithm for the dynamic economic lot size problem
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• A linear description of the discrete lot-sizing and scheduling problem
• An efficient procedure for dynamic lot-sizing model with demand time windows

zbMATH Keywords

dynamic lot-sizing

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Cites Work

• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Solving Large-Scale Zero-One Linear Programming Problems
• Title not available (Why is that?)
• Dynamic version of the economic lot size model
• The dynamic lot size model with quantity discount

Cited In (12)

• An Integer Programming Approach to the Apparel Sizing Problem
• An improved algorithm for the dynamic lot-sizing problem with learning effect in setups
• An efficient procedure for dynamic lot-sizing model with demand time windows
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
• Title not available (Why is that?)
• The synchronized and integrated two-level lot sizing and scheduling problem: evaluating the generalized mathematical model
• A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan
• The dynamic lot-sizing problem with variable unit costs
• An efficient dynamic programming approach to optimize capacitated lot-sizing problem
• The efficient computer implementation of a large-scale integer goal programming model
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs

Uses Software

• LINDO

This page was built for publication: An efficient integer programming model of the dynamic lot-sizing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4298947)