Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1704361 | Applied Mathematical Modelling | 2013 | 6 Pages |
Abstract
We consider a problem of scheduling n independent jobs on m parallel identical machines. The jobs are available at time zero, but the machines may not be available simultaneously at time zero. We concentrate on two goals separately, namely, minimizing a cost function containing total completion time and total absolute differences in completion times; minimizing a cost function containing total waiting time and total absolute differences in waiting times. In this paper, we present polynomial time algorithm to solve this problem.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Lixin Shen, Dan Wang, Xiao-Yuan Wang,