TY - JOUR

T1 - High Multiplicity Scheduling with Switching Costs for few Products

AU - Gabay, Michaël

AU - Grigoriev, Alexander

AU - Kreuzen, V.J.

AU - Oosterwijk, Tim

PY - 2016/3

Y1 - 2016/3

N2 - 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.

AB - 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.

UR - http://arxiv.org/abs/1504.00201v1

M3 - Article

JO - Operations Research Proceedings 2014

JF - Operations Research Proceedings 2014

ER -