A polynomial algorithm for a multi-item capacitated production planning problem
type: Item
instance of: scholarly article
title: A polynomial algorithm for a multi-item capacitated production planning problem
zbMATH Open document ID: 0801.90052
DOI: 10.1016/0167-6377(93)90051-H
author: Meltem Denizel-Sivri
author: S. Selcuk Erenguc
published in: Operations Research Letters
publication date: 1994-03-14T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 519590
zbMATH Keywords: multi-item
zbMATH Keywords: lot sizing
zbMATH Keywords: computational bound
zbMATH Keywords: production planning
zbMATH Keywords: manufacturing
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: worst case computational bound
zbMATH Keywords: single machine static scheduling
MaRDI profile type: Publication
cites work: The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
cites work: A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
cites work: Q3940839
description: scientific article; zbMATH DE number 519590