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

Глава

Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

P. 11-27.
Mikhail Batsyn, Boris Goldengorin, Pavel Sukhov, Panos M. Pardalos.

The preemptive single machine scheduling problem of minimizing the total weighted completion time with equal processing times and arbitrary release dates is one of the four single machine scheduling problems with an open computational complexity status. In this paper we present lower and upper bounds for the exact solution of this problem based on the assignment problem. We also investigate properties of these bounds and worst-case behavior.

В книге

Vol. 59. NY: Springer, 2013.