| dc.description.abstract | In home healthcare service, patients with different health condition background require
different types of resources and the serving time among these patients also vary. The
hospitals and their vehicle fleet with limited carrying capacity are responsible for
transporting medical equipment, medicine, medical staff to patient locations. The
problem is categorized as Multi-resources Routing and Scheduling problem (MRRSP).
A Mixed-Integer Linear Programming model is developed to decide the scheduling
and routing decision of the vehicle carrying the resources from the hospital to patient
locations that minimize the total weighted completion time by choosing the shortest
distance among the visiting locations as well as considering the processing time at
these points. The MRRSP is an NP-hard problem and cannot be solved within a
polynomial-time so a heuristics algorithm is developed to solve the real-size problem.
The computational time of the Greedy algorithm proves to be effective when applying
in real- life situations. | en_US |
