Book chapter
Polynomial Algorithm for 1 | rj,pj = p, pmnt | Σ wicj Scheduling Problem
In this paper we consider the minimizing total weightedcompletion time in preemptive equal job length schedulingproblem on a single machine. We propose a polynomialtime algorithm that solves the problem. Before this paper the problem were known to be open.
Language:
English