In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

In this paper we develop branch and bound algorithms for a number of hard, two-agent scheduling problems, i.e., problems in which each agent has an objective function which depends on the completion times of its jobs only. We address the minimization of total weighted completion time of the first agent jobs, subject to a bound on the cost function of the second agent, which may be: (i) total we...

The COMPLETION global constraint has been proposed for single-machine, unary-resource, total weighted completion time scheduling problems where it has shown good performance. In this paper, we look at extending the constraint in two ways. First, we apply the constraint to multiple machine scheduling problems, in the form of job shop scheduling. It is shown that under the right allocation of wei...

In this paper, we present a novel O(N) algorithm to minimize the weighted number of tardy jobs with unit processing times, integer ready times and deadlines, and M homogeneous parallel machines, where N is the number of jobs to be scheduled. wi is the weight re ecting job i's importance, and Ui is 1 if job i is tardy and 0 otherwise, so P wiUi is the measure of performance. (In standard notatio...

let and be a sequence with non-negative entries. if , denote by the infimum of those satisfying the following inequality: whenever . the purpose of this paper is to give an upper bound for the norm of operator t on weighted sequence spaces d(w,p) and lp(w) and also e(w,?). we considered this problem for certain matrix operators such as norlund, weighted mean, ceasaro and copson matrices. th...