Abstract
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 language | English |
---|---|
Title of host publication | Operations Research Proceedings 2014 |
Subtitle of host publication | Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), RWTH Aachen University, Germany, September 2–5, 2014 |
Publisher | Springer |
Pages | 437-443 |
Number of pages | 7 |
ISBN (Electronic) | 978-3-319-28697-6 |
ISBN (Print) | 978-3-319-28695-2 |
DOIs | |
Publication status | Published - 21 Feb 2016 |
Event | Annual International Conference of the German Operations Research Society - RWTH, Aachen, Germany Duration: 3 Sept 2014 → 5 Nov 2014 http://link.springer.com/chapter/10.1007/978-3-319-28697-6_61 |
Publication series
Series | Operations Research Proceedings |
---|---|
ISSN | 0721-5924 |
Conference
Conference | Annual International Conference of the German Operations Research Society |
---|---|
Country/Territory | Germany |
City | Aachen |
Period | 3/09/14 → 5/11/14 |
Internet address |