A linear description of the discrete lot-sizing and scheduling problem
type: Item
instance of: scholarly article
title: A linear description of the discrete lot-sizing and scheduling problem
zbMATH Open document ID: 0806.90028
DOI: 10.1016/0377-2217(94)90079-5
author: Stan Van Hoesel
author: Antoon W. J. Kolen
published in: European Journal of Operational Research
publication date: 1994-08-21T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 622628
zbMATH Keywords: integer linear programming
zbMATH Keywords: discrete lot-sizing
zbMATH Keywords: shortest path problem
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90079-5
OpenAlex ID: W2112177855
cites work: Strong Formulations for Multi-Item Capacitated Lot Sizing
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: The discrete lot-sizing and scheduling problem
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Q4139966
cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
cites work: Deterministic lotsizing models for production planning
cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem
cites work: Q3964308
cites work: Dynamic version of the economic lot size model
cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
description: scientific article; zbMATH DE number 622628