Abstract
In this paper, we introduce the Setup Carryover Assignment Problem (SCAP), which consists of determining the setup carryover plan of multiple items for a given lot size over a finite planning horizon with the objective of maximizing setup cost savings. This problem is an extension of the standard Capacitated Lot Sizing Problem (CLSP). We show that the straightforward linear programming (LP) formulation of the problem provides a fractional solution. However, we propose an alternative integer linear program (ILP) and show that it has a totally unimodular property and thus yields an integer solution. Therefore, SCAP is solvable in polynomial time.
| Original language | English |
|---|---|
| Article number | 25 |
| Journal | Operations Research Forum |
| Volume | 4 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 2023 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2023, The Author(s), under exclusive licence to Springer Nature Switzerland AG.
Keywords
- Integer linear programming
- Linear program relaxation
- Lot size
- Setup carryover
ASJC Scopus subject areas
- Economics, Econometrics and Finance (miscellaneous)
- Computer Science Applications
- Control and Optimization
- Applied Mathematics