Worst case bound of an LRF schedule for the mean weighted flow-time problem
SIAM Journal on Computing
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
Mathematics of Operations Research
A fuzzy logic approach to dynamic Dial-A-Ride problem
Fuzzy Sets and Systems - special issue on fuzzy sets in traffic and transport systems
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Coordinating Mutually Exclusive Resources using GPGP
Autonomous Agents and Multi-Agent Systems
Computers and Operations Research
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
Computers and Operations Research
On-line scheduling to minimize average completion time revisited
Operations Research Letters
| Hi-index | 0.00 |
Objective: The aim of this study was to develop an algorithm for scheduling pick-up and delivery tasks in hospitals. The number of jobs and the dynamic nature of the problem, in having jobs arriving over time, makes the use of information technology indispensable. An optimized scheduling for all types of transportation tasks occurring in a hospital accelerates medical procedures, and reduces the patient's waiting time and costs. Methods: In the design of the algorithm we use techniques from classical scheduling theory. In addition, due to some special properties and constraints, we model the problem using methods from graph theory. The resulting algorithm combines both approaches in a transparent manner. Conclusions: To optimize the schedules, we define the average weighted flow time as an objective function that corresponds to a measure for the task throughput. An evaluation of the algorithm at the Natters State Hospital in Austria shows that it has a superior performance than the current scheduling mechanism.