Effectiveness in the use of the work force is often the crucial advantage in a company's long-term success over its competitors, especially in technology driven and highly competitive branches as the one considered in this article. While employee scheduling and rostering has been the topic of...

The thesis provides an algorithmic approach to the scheduling problem for call centre agents. It shows that this problem is NP-complete and even inapproximable. A broad statistical analysis of call data from a call centre is contained, too.

In 1997 two papers new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired...