Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Park, Jongyoon | - |
dc.contributor.author | Han, Jinil | - |
dc.contributor.author | Lee, Kyungsik | - |
dc.date.accessioned | 2024-07-01T07:00:49Z | - |
dc.date.available | 2024-07-01T07:00:49Z | - |
dc.date.issued | 2024-08 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.issn | 1872-6860 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/49779 | - |
dc.description.abstract | The resource allocation problem (RAP) determines a solution to optimally allocate limited resources to several activities or tasks. In this study, we propose a novel resource allocation problem referred to as multi -period non-shareable resource allocation problem (MNRAP), which is motivated by the characteristics of resources considered in the stem cell culture process for producing stem cell therapeutics. A resource considered in the MNRAP has the following three characteristics: (i) resource consumption required to perform an activity and available resource capacity may change over time; (ii) multiple activities cannot share one resource; and (iii) resource requirements can be satisfied through the combination of different types of resources. The MNRAP selects some of the given activities to maximize the overall profit under limited resources with these characteristics. To address this problem, pattern -based integer programming formulations based on the concept of resource patterns are proposed. These formulations attempt to overcome the limitations of a compact integer programming formulation, the utilization of which is challenging for large-scale problems owing to their complexity. Further, based on a branch -and -price approach to solving pattern -based formulations, effective heuristic algorithms are proposed to provide high -quality solutions for large instances. Moreover, through computational experiments on a wide range of instances, including real -world instances, the superiority of the proposed formulations and heuristic algorithms is demonstrated. | - |
dc.format.extent | 17 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ELSEVIER | - |
dc.title | Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.ejor.2024.03.027 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.317, no.1, pp 43 - 59 | - |
dc.identifier.wosid | 001236029600001 | - |
dc.identifier.scopusid | 2-s2.0-85189014490 | - |
dc.citation.endPage | 59 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 43 | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 317 | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0377221724002273?via%3Dihub | - |
dc.publisher.location | 네델란드 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Assignment | - |
dc.subject.keywordAuthor | Multi-period resource allocation | - |
dc.subject.keywordAuthor | Non-shareable resource | - |
dc.subject.keywordAuthor | Integer optimization | - |
dc.subject.keywordAuthor | Branch-and-price-based heuristic | - |
dc.subject.keywordPlus | LINEAR-PROGRAMMING APPROACH | - |
dc.subject.keywordPlus | PROJECT SCHEDULING PROBLEM | - |
dc.subject.keywordPlus | SELECTION | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.