Cyclic lot-sizing problems with sequencing costs
type: Item
instance of: scholarly article
title: Cyclic lot-sizing problems with sequencing costs
zbMATH Open document ID: 1479.90090
author: Alexander Grigoriev
author: Tim Oosterwijk
author: Vincent J. C. Kreuzen
published in: Journal of Scheduling
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7443456
zbMATH Keywords: lot-sizing problem
zbMATH Keywords: sequencing costs
zbMATH Keywords: high multiplicity
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10951-020-00645-8
OpenAlex ID: W3008292280
cites work: From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
cites work: The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
cites work: A framework for the complexity of high-multiplicity scheduling problems
cites work: Multiplicity and complexity issues in contemporary production scheduling
cites work: High Multiplicity in Earliness-Tardiness Scheduling
cites work: Parallel machine scheduling with high multiplicity
cites work: Exact and approximate algorithms for high-multiplicity parallel machine scheduling
cites work: High Multiplicity Scheduling with Switching Costs for Few Products
cites work: Scheduling a Multi-Product Single Machine System
cites work: Capacitated lot-sizing with sequence dependent setup costs
cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
cites work: A characterization of the minimum cycle mean in a digraph
DOI: 10.1007/S10951-020-00645-8
description: scientific article; zbMATH DE number 7443456