Search Results - "Veltman, Bart"

A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem by Burke, Edmund K., Curtois, Timothy, Post, Gerhard, Qu, Rong, Veltman, Bart

“…This paper is concerned with the development of intelligent decision support methodologies for nurse rostering problems in large modern hospital environments…”
Get full text

Shift rostering using decomposition: assign weekend shifts first by van der Veen, Egbert, Hans, Erwin W., Post, Gerhard F., Veltman, Bart

“…This paper introduces a shift rostering problem that surprisingly has not been studied in the literature: the weekend shift rostering problem. It is motivated…”
Get full text

A case study of cost-efficient staffing under annualized hours by van der Veen, Egbert, Hans, Erwin W., Veltman, Bart, Berrevoets, Leo M., Berden, Hubert J.J.M.

“…We propose a mathematical programming formulation that incorporates annualized hours and shows to be very flexible with regard to modeling various contract…”
Get full text

ORchestra: an online reference database of OR/MS literature in health care by Hulshof, Peter J. H., Boucherie, Richard J., Essen, J. Theresia van, Hans, Erwin W., Hurink, Johann L., Kortbeek, Nikky, Litvak, Nelly, Vanberkel, Peter T., Veen, Egbert van der, Veltman, Bart, Vliegen, Ingrid M. H., Zonderland, Maartje E.

“…We introduce the categorized reference database ORchestra, which is available online at http://www.utwente.nl/choir/orchestra/ …”
Get full text

Sequencing and Cooperation by Curiel, Imma, Potters, Jos, Prasad, Rajendra, Tijs, Stef, Veltman, Bart

“…In machine scheduling the first problem is to find a timetable that is optimal with respect to some efficiency criterion. If the jobs come from different…”
Get full text

Cooperation in one machine scheduling by Curiel, Imma, Potters, Jos, Prasad, Rajendra, Tijs, Stef, Veltman, Bart

Get full text

The Complexity of Scheduling Trees with Communication Delays by Lenstra, Jan Karel, Veldhorst, Marinus, Veltman, Bart

“…We consider the problem of finding a minimum-length schedule onmmachines for a set ofnunit-length tasks with a forest of intrees as precedence relation, and…”
Get full text