ИСТИНА

We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with releasedates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on asingle or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the job jcompletion time. We have suggest an approximation scheme to find approximateoptimal value of the objective function.