High Multiplicity Scheduling with Switching Costs for few Products

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

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review


We study several variants of the single machine capacitated lot sizing problem with sequence-dependent setup costs and product-dependent inventory costs. Here we are given one machine and n >= 1 types of products that need to be scheduled. Each product is associated with a constant demand rate d_i, production rate p_i and inventory costs per unit h_i. When the machine switches from producing product i to product j, setup costs s_{i,j} are incurred. The goal is to minimize the total costs subject to the condition that all demands are satisfied and no backlogs are allowed. 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.
Original languageEnglish
Title of host publicationOperations Research Proceedings
Publication statusPublished - Mar 2016

Bibliographical note

To be published in: Operations Research Proceedings 2014.


Dive into the research topics of 'High Multiplicity Scheduling with Switching Costs for few Products'. Together they form a unique fingerprint.

Cite this