Computer-Aided Way to Prove Theorems in Scheduling

  • Authors:

  • Sergey V. Sevastianov;I. D. Tchernykh

  • Affiliations:

  • -;-

  • Venue:
  • ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

For two scheduling problems (O3||Cmax and AL3||Cmax) tight bounds of the optima localization intervals are found in terms of lower bounds (C and Č, respectively) computable in linear time. The main part of the proof was made with an aid of computer. As a by-product, we obtain linear-time approximation algorithms for solving these problems with worst-case performance ratios 4/3 and 5/3, respectively.