Mustafa Arslan OrnekCemalettin ÖztürkIpek Sugut2025-10-062019096969970969-699710.1016/j.jairtraman.2019.03.005https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063893742&doi=10.1016%2Fj.jairtraman.2019.03.005&partnerID=40&md5=4df1e5e0104c765261b15213ea3c0890https://gcris.yasar.edu.tr/handle/123456789/9403Check-in counters have a great impact on the quality of service for airports. It is airport management's responsibility to provide check-in counters to airlines. Each check-in group (i.e. flights sharing the same resources) has a counter demand and this gives rise to a counter assignment problem. This is due to a number of objectives and constraints under which check-in groups are allocated to check-in counters. In this paper we develop an Integer Programming model to optimally assign incoming flights to check-in counters and propose a decomposition algorithm to solve the allocation problem in a reasonable time. Computational results from a medium sized airport indicate a better utilisation of check-in counters enabling airport management to reduce/postpone investment in additional check-in counters. © 2019 Elsevier B.V. All rights reserved.EnglishAirport Management, Counter Assignment, Heuristics, Integer Programming, Airport, Algorithm, Heuristics, Management, Numerical Model, Optimizationairport, algorithm, heuristics, management, numerical model, optimizationArticle