An algorithm based on a new sufficient condition of optimality in dynamic lot size model
type: Item
instance of: scholarly article
title: An algorithm based on a new sufficient condition of optimality in dynamic lot size model
zbMATH Open document ID: 0767.90028
DOI: 10.1016/0377-2217(92)90199-J
published in: European Journal of Operational Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 92709
zbMATH Keywords: sufficient condition of optimality
zbMATH Keywords: production scheduling
zbMATH Keywords: deterministic time-varying demand
zbMATH Keywords: dynamic lot size problem
author: Mir-Bahador Aryanezhad
MaRDI profile type: Publication
cites work: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
cites work: Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
cites work: Stability of the constant cost dynamic lot size model
cites work: Dynamic version of the economic lot size model
cites work: A Deterministic Multi-Period Production Scheduling Model with Backlogging
cites work: From EOQ Towards ZI
full work available at URL: 0377-2217(92)90199-j
OpenAlex ID: W1979556798
description: scientific article; zbMATH DE number 92709