We consider the scheduling problem of minimizing the average-weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith’s ratio rule yield smaller competitive ratios than the previously best-known deterministic on-line algorithms. c © 2003 Elsevier B.V. All righ...

Single machine scheduling problems with release time are the prototypes for other complicated scheduling systems. Genetic local search algorithms are proposed to minimize total weighted completion time. Numerical experiments to evaluate the three embedding local search techniques are done. The results indicate that the Irj+tj rule proposed by Liu and MacCathy (1991) outperform ERT and WSPT.

We study the matrix completion problem when observation pattern is deterministic and possibly non-uniform. propose a simple efficient debiased projection scheme for recovery from noisy observations analyze error under suitable weighted metric. introduce function of weight sampling that governs accuracy recovered matrix. derive theoretical guarantees upper bound nearly matching lower bounds show...

<p style='text-indent:20px;'>In recent years, significant on the past sequence dependent delivery times have been increasing for scheduling problems. An electronic component when waiting to process may be exposed certain an electromagnetic field and is required neutralize effect of electromagnetism. In this case, it needs extra time eliminate adverse effect. literature, called as past-seq...