Cyclic lot-sizing problems with sequencing costs

DOI10.1007/s10951-020-00645-8zbMath1479.90090OpenAlexW3008292280MaRDI QIDQ2061136

Tim Oosterwijk, Alexander Grigoriev, Vincent J. C. Kreuzen

Publication date: 13 December 2021

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-020-00645-8

zbMATH Keywords

approximation algorithmhigh multiplicitylot-sizing problemsequencing costs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• A characterization of the minimum cycle mean in a digraph
• Capacitated lot-sizing with sequence dependent setup costs
• A framework for the complexity of high-multiplicity scheduling problems
• High Multiplicity Scheduling with Switching Costs for Few Products
• From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
• The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• High Multiplicity in Earliness-Tardiness Scheduling
• Multiplicity and complexity issues in contemporary production scheduling
• Scheduling a Multi-Product Single Machine System
• Parallel machine scheduling with high multiplicity

This page was built for publication: Cyclic lot-sizing problems with sequencing costs