hrcak mascot   Srce   HID

Original scientific paper
https://doi.org/10.17535/crorr.2015.0032

Finding an optimal seating arrangement for employees

Ninoslav Čerkez   ORCID icon orcid.org/0000-0003-1284-481X ; IN2 d.o.o., Zagreb, Croatia
Rebeka Čorić   ORCID icon orcid.org/0000-0002-2388-385X ; Department of Mathematics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia
Mateja Đumić   ORCID icon orcid.org/0000-0001-8980-6315 ; Department of Mathematics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia
Domagoj Matijević ; Department of Mathematics, Josip Juraj Strossmayer University of Osijek, Osijek, Croatia

Fulltext: english, pdf (169 KB) pages 419-427 downloads: 783* cite
APA 6th Edition
Čerkez, N., Čorić, R., Đumić, M. & Matijević, D. (2015). Finding an optimal seating arrangement for employees. Croatian Operational Research Review, 6 (2), 419-427. https://doi.org/10.17535/crorr.2015.0032
MLA 8th Edition
Čerkez, Ninoslav, et al. "Finding an optimal seating arrangement for employees." Croatian Operational Research Review, vol. 6, no. 2, 2015, pp. 419-427. https://doi.org/10.17535/crorr.2015.0032. Accessed 24 Sep. 2020.
Chicago 17th Edition
Čerkez, Ninoslav, Rebeka Čorić, Mateja Đumić and Domagoj Matijević. "Finding an optimal seating arrangement for employees." Croatian Operational Research Review 6, no. 2 (2015): 419-427. https://doi.org/10.17535/crorr.2015.0032
Harvard
Čerkez, N., et al. (2015). 'Finding an optimal seating arrangement for employees', Croatian Operational Research Review, 6(2), pp. 419-427. https://doi.org/10.17535/crorr.2015.0032
Vancouver
Čerkez N, Čorić R, Đumić M, Matijević D. Finding an optimal seating arrangement for employees. Croatian Operational Research Review [Internet]. 2015 [cited 2020 September 24];6(2):419-427. https://doi.org/10.17535/crorr.2015.0032
IEEE
N. Čerkez, R. Čorić, M. Đumić and D. Matijević, "Finding an optimal seating arrangement for employees", Croatian Operational Research Review, vol.6, no. 2, pp. 419-427, 2015. [Online]. https://doi.org/10.17535/crorr.2015.0032

Abstracts
The paper deals with modelling a specifc problem called the Optimal Seating Arrangement (OSA) as an Integer Linear Program and demonstrated that the problem can be efficiently solved by combining branch-and-bound and cutting plane methods. OSA refers to a specific scenario that could possibly happen in a corporative environment, i.e. when a company endeavors to minimize travel costs when employees travel to an organized event. Each employee is free to choose the time to travel to and from an event and it depends on personal reasons. The paper differentiates between using different travel possibilities in the OSA problem, such as using company assigned or a company owned vehicles, private vehicles or using public transport, if needed. Also, a user-friendly web application was made and is available to the public for testing purposes.

Keywords
Integer Linear Program; branch and bound; cutting plane method

Hrčak ID: 148271

URI
https://hrcak.srce.hr/148271

Visits: 1.045 *