An algorithm based on a new sufficient condition of optimality in dynamic lot size model

DOI10.1016/0377-2217(92)90199-JzbMath0767.90028OpenAlexW1979556798MaRDI QIDQ1198322

Mir-Bahador-Qoli Aryanezhad

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90199-j

zbMATH Keywords

production schedulingdynamic lot size problemdeterministic time-varying demandsufficient condition of optimality

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Extensions of simple eyeballing dynamic lot sizing heuristics. ⋮ ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت

Cites Work

• Stability of the constant cost dynamic lot size model
• Dynamic Version of the Economic Lot Size Model
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• From EOQ Towards ZI
• A Deterministic Multi-Period Production Scheduling Model with Backlogging
• Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model

This page was built for publication: An algorithm based on a new sufficient condition of optimality in dynamic lot size model