Basit öğe kaydını göster

dc.contributor.authorBektur, Gülçin
dc.date.accessioned2020-12-25T11:02:14Z
dc.date.available2020-12-25T11:02:14Z
dc.date.issued2020en_US
dc.identifier.citationBektur, G. (2020). A multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problem. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 10(1), 37 - 46. https://doi.org/10.11121/i jocta.01.2020.00796en_US
dc.identifier.issn2146-0957
dc.identifier.urihttps://doi.org/10.11121/i jocta.01.2020.00796
dc.identifier.urihttps://hdl.handle.net/20.500.12508/1562
dc.description.abstractIn this study, a multi-resource agent bottleneck generalized assignment problem (MRBGAP) is addressed. In the bottleneck generalized assignment problem (BGAP), more than one job can be assigned to an agent, and the objective function is to minimize the maximum load over all agents. In this problem, multiple resources are considered and the capacity of the agents is dependent on these resources and it has minimum two indices. In addition, agent qualifications are taken into account. In other words, not every job can be assignable to every agent. The problem is defined by considering the problem of assigning jobs to employees in a firm. BGAP has been shown to be NP- hard. Consequently, a multi-start iterated tabu search (MITS) algorithm has been proposed for the solution of large-scale problems. The results of the proposed algorithm are compared by the results of the tabu search (TS) algorithm and mixed integer linear programming (MILP) model. © This work is licensed under a Creative Commons Attribution 4.0 International License. The authors retain ownership of the copyright for their article, but they allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited. To see the complete license contents, please visit http://creativecommons.org/licenses/by/4.0/.en_US
dc.language.isoengen_US
dc.publisherAn International Journal of Optimization and Control: Theories & Applications (IJOCTA)en_US
dc.relation.isversionof10.11121/i jocta.01.2020.00796en_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectAgent qualificationsen_US
dc.subjectAssignment problemen_US
dc.subjectInteger linear programming modelen_US
dc.subjectMulti- resource bottleneck generaliseden_US
dc.subjectMulti- start iterated local searchen_US
dc.titleA multi-start iterated tabu search algorithm for the multi-resource agent bottleneck generalized assignment problemen_US
dc.typearticleen_US
dc.relation.journalAn International Journal of Optimization and Control: Theories & Applications (IJOCTA)en_US
dc.contributor.departmentMühendislik ve Doğa Bilimleri Fakültesi -- Endüstri Mühendisliği Bölümüen_US
dc.identifier.volume10en_US
dc.identifier.issue1en_US
dc.identifier.startpage37en_US
dc.identifier.endpage46en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.contributor.isteauthorBektur, Gülçin
dc.relation.indexScopus - TR-Dizinen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster