We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n) algorithm is proposed, which makes use of the preemptive mean busy time relaxation of the scheduling problem. The solution to this problem is used to test if an activity can start at each start time in its domain in solutions th...

this paper explores the flexile flow lines where setup times are sequence- dependent. the optimization criterion is the minimization of total weighted completion time. we propose an iterated greedy algorithm (iga) to tackle the problem. an experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of iga are compared against those of some other exist...

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing job j on machine i requires time pif and incurs a cost of c,f, each machine / is available for 7", t ime units, and the objective is.t»minimize the total cost incurred. Our main result is as follows. There is a polyn...

A fair scheduling algorithm accounting for the weight and execution time of tasks is critical in the Grid environment. The MTWCT (Minimize Total Weighted Completion Time) has been proved to minimize the total weighted completion time of a set of independent tasks in a processor, but it results in another problem that the response time of some tasks is far longer. To decrease the incidence of th...

nowadays project management is a key component in introductory operations management. the educators and the researchers in these areas advocate representing a project as a network and applying the solution approaches for network models to them to assist project managers to monitor their completion. in this paper, we evaluated project’s completion time utilizing the q-learning algorithm. so the ...

This paper is about scheduling parallel jobs, i.e. which can be executed on more than one processor at the same time. Malleable jobs is a special class of parallel jobs. The number of processors a malleable job is executed on may change during the execution. In this work, we consider the NP-hard problem of scheduling malleable jobs to minimize the total weighted completion time or mean weighted...