| Title | A lot-sizing problem in deliberated and controlled co-production systems |
|---|---|
| ID_Doc | 17337 |
| Authors | Pamuk, B; Agrali, S; Taskin, ZC; Kabakulak, B |
| Title | A lot-sizing problem in deliberated and controlled co-production systems |
| Year | 2022 |
| Published | Iise Transactions, 54, 10 |
| Abstract | We consider an uncapacitated lot-sizing problem in co-production systems, in which it is possible to produce multiple items simultaneously in a single production run. Each product has a deterministic demand to be satisfied on time. The decision is to choose which items to co-produce and the amount of production throughout a predetermined planning horizon. We show that the lot-sizing problem with co-production is strongly NP-Hard. Then, we develop various Mixed-Integer Linear Programming (MILP) formulations of the problem and show that LP relaxations of all MILPs are equal. We develop a separation algorithm based on a set of valid inequalities, lower bounds based on a dynamic lot-sizing relaxation of our problem and a constructive heuristic that is used to obtain an initial solution for the solver, which form the basis of our proposed Branch & Cut algorithm for the problem. We test our models and algorithms on different data sets and provide the results. |
| http://openaccess.mef.edu.tr/xmlui/bitstream/20.500.11779/1728/1/A%20Lot%20Sizing%20Problem%20in%20Deliberated%20and%20Controlled%20Co%20Production%20Systems.pdf |
No similar articles found.