pith. sign in

arxiv: 1504.00201 · v1 · pith:SRXWBYYKnew · submitted 2015-04-01 · 🧮 math.OC

High Multiplicity Scheduling with Switching Costs for few Products

classification 🧮 math.OC
keywords costsproductsswitchinghighmachinemultiplicityratesingle
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.