A Two-Stage Method of Dimensioning and Scheduling Service Providers under Patient Demand Uncertainty

Algorithm 1

K-means Algorithm.

(1)	X : set of data points
(2)	k: number of clusters
(3)	Randomly initialize k cluster centers(centroids) from X
(4)	Repeat
(5)	Expectation: assign each point to its closest centroid.
(6)	Maximization: the mean of all points belonging to each cluster specifies the new centroid
	Until the centroid positions converge to a constant value