High multiplicity scheduling with switching costs for few products

DOI10.1007/978-3-319-28697-6_61MaRDI QIDQ2806978zbMATHOpenAlexFDO

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)

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)

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.

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

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

Cited in

(2)

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

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)