M. Arslan OrnekCemalettin OzturkIpek SugutSugut, IpekOrnek, M. ArslanOzturk, Cemalettin2025-10-0620190969-69971873-208910.1016/j.jairtraman.2019.03.0052-s2.0-85063893742http://dx.doi.org/10.1016/j.jairtraman.2019.03.005https://gcris.yasar.edu.tr/handle/123456789/7085https://doi.org/10.1016/j.jairtraman.2019.03.005Check-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.Englishinfo:eu-repo/semantics/closedAccessCounter assignment, Integer programming, Heuristics, Airport managementCHECK-IN COUNTERS, OPTIMIZATION, ALLOCATION, SIMULATION, ALGORITHMCounter AssignmentInteger ProgrammingHeuristicsAirport ManagementArticle