Reductions between scheduling problems with non-renewable resources and knapsack problems

Péter Györgyi, Tamás Kis

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper we establish approximation preserving reductions between scheduling problems in which jobs either consume some raw materials, or produce some intermediate products, and variants of the knapsack problem. Through the reductions, we get new approximation algorithms, as well as inapproximability results for the scheduling problems.

Original languageEnglish
Pages (from-to)63-76
Number of pages14
JournalTheoretical Computer Science
Volume565
Issue numberC
DOIs
Publication statusPublished - Jan 1 2015

    Fingerprint

Keywords

  • Approximation preserving reductions
  • Knapsack problems
  • Scheduling problems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this