• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Статья

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

Optimization Methods and Software. 2014. Vol. 29. No. 5. P. 955-963.
Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov.

The preemptive single machine scheduling problem of minimizing the total weighted completion time with arbitrary processing times and release dates is an important NP-hard problem in scheduling theory. In this paper we present an efficient high-quality heuristic for this problem based on the WSRPT (Weighted Shortest Remaining Processing Time) rule. The running time of the suggested algorithm increases only as a square of the number of jobs. Our computational study shows that very large size instances might be treated within extremely small CPU times and the average error is always less than 0.1%.