<abstract><p>We consider a basic preemptive scheduling problem where $ n non-simultaneously released jobs are to be processed by m unrelated parallel machines so as minimize maximum job completion time. An optimal LP-solution has been used construct an schedule for simultaneously in time O(n^3) $. We propose fast O(m) algorithm that finds case the above possesses "small enough" numb...

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines. Each of the jobs is associated with a release time, a deadline, a weight, and a processing time on each of the machines. The goal is to find a nonpreemptive schedule that maximizes the weight of jobs that meet their respective deadlines. We give constant factor approximation alg...