Heuristic time scheduling algorithm
 

Problem Description:

 

patient

 

Nurse's busy time= serving time + traveling time

 

2

 

Traveling time is given by matrix

 

Goal: schedule nurse (s) that all

 

nurse

 

3

 

the patient can be served

 

1

 

Merits:

 

(1) a nurse can serve as many

 

4

 

5

 

patients as possible.

 

6

 

(2) minimize the number of

 

nurses needed