A lot-sizing problem in deliberated and controlled co-production systems
dc.contributor.author | Kabakulak, Banu | |
dc.date.accessioned | 2022-11-11T09:19:43Z | |
dc.date.available | 2022-11-11T09:19:43Z | |
dc.date.issued | 2022 | |
dc.description.abstract | 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. © Copyright © 2022 “IISE”. | en_US |
dc.fullTextLevel | Full Text | en_US |
dc.identifier.doi | 10.1080/24725854.2021.2022250 | en_US |
dc.identifier.issn | 2472-5854 | |
dc.identifier.scopus | 2-s2.0-85124411078 | en_US |
dc.identifier.uri | https://hdl.handle.net/11411/4668 | |
dc.identifier.uri | https://doi.org/10.1080/24725854.2021.2022250 | |
dc.identifier.wos | WOS:000754103800001 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.issue | 10 | en_US |
dc.language.iso | en | en_US |
dc.national | International | en_US |
dc.numberofauthors | 4 | en_US |
dc.pages | 950 - 962 | en_US |
dc.publisher | Taylor and Francis Ltd. | en_US |
dc.relation.ispartof | IISE Transactions | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | branch & cut | en_US |
dc.subject | Co-production | en_US |
dc.subject | lot-sizing | en_US |
dc.subject | MILP | en_US |
dc.title | A lot-sizing problem in deliberated and controlled co-production systems | en_US |
dc.type | Article | en_US |
dc.volume | 54 | en_US |