Andreas T. Ernst

Learn More
This paper presents a review of staff scheduling and rostering, an area that has become increasingly important as business becomes more service oriented and cost conscious in a global environment. Optimised staff schedules can provide enormous benefits, but require carefully implemented decision support systems if an organisation is to meet customer demands(More)
Several of the more important endmember-finding algorithms for hyperspectral data are discussed and some of their shortcomings highlighted. A new algorithm—iterated constrained endmembers (ICE)—which attempts to address these shortcomings is introduced. An example of its use is given. There is also a discussion of the advantages and disadvantages of(More)
In this paper, we present an efficient approach for solving capacitated single allocation hub location problems. We use a modified version of a previous mixed integer linear programming formulation developed by us for p-hub median problems. This formulation requires fewer variables and constraints than those traditionally used in the literature. We develop(More)
Computational methods for rostering and personnel scheduling has been a subject of continued research and commercial interest since the 1950s. This annotated bibliography puts together a comprehensive collection of some 700 references in this area, focusing mainly on algorithms for generating rosters and personnel schedules but also covering related areas(More)
The problem of scheduling aircraft landings on one or more runways is an interesting problem that is similar to a machine job scheduling problem with sequence-dependent processing times and with earliness and tardiness penalties. The aim is to optimally land a set of planes on one or several runways in such a way that separation criteria between all pairs(More)
The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either(More)