The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
type: Item
instance of: scholarly article
title: The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
zbMATH Open document ID: 0793.90018
DOI: 10.1016/0166-218X(92)00182-L
author: Stan Van Hoesel
author: Roelof Kuik
author: Marc Salomon
author: Luk N. Van Wassenhove
published in: Discrete Applied Mathematics
publication date: 1994-03-24T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 527433
zbMATH Keywords: lotsizing
zbMATH Keywords: single-item discrete lotsizing
MaRDI profile type: Publication
cites work: A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
cites work: The discrete lot-sizing and scheduling problem
cites work: An Efficient Algorithm for Multi-Item Scheduling
cites work: A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
cites work: Some Extensions of the Discrete Lotsizing and Scheduling Problem
cites work: Q3964308
cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
full work available at URL: 0166-218x(92)00182-l
OpenAlex ID: W2015682010
description: scientific article; zbMATH DE number 527433