.png){kind=icon}
.png){kind=icon}
Return
Load balancing a priori strategy for the probabilistic weighted flowtime problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2012.06.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a previous work (Bouyahia et al., 2010), we introduced and studied the probabilistic generalization of the classical total weighted completion time problem. We defined two a priori strategies devoted to the incorporated problem on parallel identical machines U-A and U-B). The main drawback of the proposed a priori strategies is that the machine loads are not balanced after deleting the absent jobs from an a priori schedule. In this paper, we try to overcome this limitation by proposing an a priori strategy denoted as UB which takes into account the load balance. First, we present the algorithm of the load balancing strategy and we explicit the objective function. Then, we study its complexity and its performance compared to the other strategies. Special care is also devoted to assess experimentally the performance of U-k (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Probabilistic scheduling problem
Total weighted completion time
A priori strategy
Loads balancing
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W