High multiplicity scheduling with switching costs for few products
From MaRDI portal
Publication:2806978
DOI10.1007/978-3-319-28697-6_61zbMATH Open1342.90060arXiv1504.00201OpenAlexW2486678642MaRDI QIDQ2806978FDOQ2806978
Authors: Michaël Gabay, Vincent J. C. Kreuzen, Tim Oosterwijk, Alexander Grigoriev 
Publication date: 19 May 2016
Published in: Operations Research Proceedings (Search for Journal in Brave)
Abstract: We study a variant of the single machine capacitated lot-sizing problem with sequence-dependent setup costs and product-dependent inventory costs. We are given a single machine and a set of products associated with a constant demand rate, maximum loading rate and holding costs per time unit. Switching production from one product to another incurs sequencing costs based on the two products. In this work, we show that by considering the high multiplicity setting and switching costs, even trivial cases of the corresponding "normal" counterparts become non-trivial in terms of size and complexity. We present solutions for one and two products.
Full work available at URL: https://arxiv.org/abs/1504.00201
Recommendations
- Cyclic lot-sizing problems with sequencing costs
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Scheduling multiple products on parallel machines with setup costs
- Economic scheduling of products with \(N\) components on a single machine
Cites Work
Cited In (2)
This page was built for publication: High multiplicity scheduling with switching costs for few products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806978)
