High Multiplicity Scheduling with Switching Costs for Few Products

DOI10.1007/978-3-319-28697-6_61zbMath1342.90060arXiv1504.00201OpenAlexW2486678642MaRDI QIDQ2806978

Alexander Grigoriev, Tim Oosterwijk, Michaël Gabay, Vincent J. C. Kreuzen

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00201

zbMATH Keywords

single machine capacitated lot sizing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Cyclic lot-sizing problems with sequencing costs

Cites Work

• A framework for the complexity of high-multiplicity scheduling problems
• Scheduling a Multi-Product Single Machine System

This page was built for publication: High Multiplicity Scheduling with Switching Costs for Few Products