Scheduling two classes of exponential jobs on parallel processors: structural results and worst case analysis

[[abstract]]In this paper, we consider scheduling problems with m machines in parallel and two classes of job. We assume that all jobs are present at time 0 and there are no further arrivals. The service times of class 1 (2) jobs are independent and exponentially distributed with mean μ 1 -1(μ 2 -1). Each class 1 (2) job incurs a cost c1(c2) per unit of time until it leaves the system. The objective is to minimize the expected total cost, that is the expected weighted sum of completion times. We show that the optimal policy among all preemptive policies is of threshold type. Based on these structural results, we also show that the ratio of the expected weighted sum of completion times under the cμ -rule to that under the optimal rule is less than 1·71.[[fileno]]2030162010037[[department]]電機工程學