Research Article
A Two-Stage Method of Dimensioning and Scheduling Service Providers under Patient Demand Uncertainty
(1) | X : set of data points | (2) | k: number of clusters | (3) | Randomly initialize k medoids from X | (4) | Repeat | (5) | Expectation: assign each point to its closest medoid. | (6) | Maximization: specify the new medoid for cluster k. | | Until the medoids have no change |
|