Load balancing a priori strategy for the probabilistic weighted flowtime problem

Authors:
Zied Bouyahia;Monia Bellalouna;Khaled Ghedira
Affiliations:
SOIE Laboratory, National School for Computer Studies, La Manouba, Tunisia;SOIE Laboratory, National School for Computer Studies, La Manouba, Tunisia;SOIE Laboratory, High Institute of Management, Le Bardo, Tunisia
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 3
Cited 0

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Rescheduling for New Orders

Operations Research
A priori parallel machines scheduling

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 U"k 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.