A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper we study the problem of deciding at what times to schedule patients when there are emergency arrivals following a non-stationary Poisson process. The service times can be any given distribution. The objective function consists of a weighted sum of the waiting times, idle time and tardiness. We prove that this objective function is multimodular, and then use a local search algorithm which in that case is guaranteed to find the optimal solution. Numerical examples show that thisdoi:10.1080/19488300.2012.665154 fatcat:zhg6ubw53bb3rpfngsfrp2cdba