• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

Polynomial Algorithm for 1 | rj,pj = p, pmnt | Σ wicj Scheduling Problem

P. 68-76.
Kvaratskhelia A., Lazarev A. A.

In this paper, we consider the minimizing total weighted completion time inpreemptive equal-length job with release dates scheduling problem on a single machine. Before this paper the problem is known to be open. Here, we present a polynomial timealgorithm that solves the problem with O(n^7) operations.