Hurink Johann

Johann Hurink

Information about the author Johann Hurink will soon be added to the site.
Found 9 papers in total
Tactical resource allocation and elective patient admission planning in care processes
Tactical resource allocation and elective patient admission planning in care processes
2013
Tactical planning of resources in hospitals concerns elective patient admission...
Decision support system for the operating room rescheduling problem
Decision support system for the operating room rescheduling problem
2012
Due to surgery duration variability and arrivals of emergency surgeries, the planned...
Efficiency evaluation for pooling resources in health care
Efficiency evaluation for pooling resources in health care
2012
Hospitals traditionally segregate resources into centralized functional departments...
Tabu search algorithms for job-shop problems with a single transport robot
Tabu search algorithms for job-shop problems with a single transport robot
2005
We consider a generalized job-shop problem where the jobs additionally have to be...
How useful are preemptive schedules?
How useful are preemptive schedules?
2003
Machine scheduling admits two options to process jobs. In a preemptive mode processing...
Solving a chemical batch scheduling problem by local search
Solving a chemical batch scheduling problem by local search
2000
In this paper the following chemical batch scheduling problem is considered: a set of...
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
1999
Positive and negative time-lags are general timing restrictions between the starting...
Scheduling identical jobs with chain precedence constraints in two uniform machines
Scheduling identical jobs with chain precedence constraints in two uniform machines
1999
The problem of scheduling identical jobs with chain precedence constraints on two...
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
1998
In this paper we present a tabu search approach for a single-machine batching problem....
Papers per page: