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

Péter Györgyi, T. Kis

Research output: Contribution to journalArticle

7 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 - 2015

Fingerprint

Knapsack Problem
Scheduling Problem
Scheduling
Inapproximability
Resources
Approximation algorithms
Approximation Algorithms
Raw materials
Approximation

Keywords

  • Approximation preserving reductions
  • Knapsack problems
  • Scheduling problems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Reductions between scheduling problems with non-renewable resources and knapsack problems. / Györgyi, Péter; Kis, T.

In: Theoretical Computer Science, Vol. 565, No. C, 2015, p. 63-76.

Research output: Contribution to journalArticle

@article{684c36bff2cd44ac8c283593f538f706,
title = "Reductions between scheduling problems with non-renewable resources and knapsack problems",
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.",
keywords = "Approximation preserving reductions, Knapsack problems, Scheduling problems",
author = "P{\'e}ter Gy{\"o}rgyi and T. Kis",
year = "2015",
doi = "10.1016/j.tcs.2014.11.007",
language = "English",
volume = "565",
pages = "63--76",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

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

AU - Györgyi, Péter

AU - Kis, T.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Approximation preserving reductions

KW - Knapsack problems

KW - Scheduling problems

UR - http://www.scopus.com/inward/record.url?scp=84926343217&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84926343217&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.11.007

DO - 10.1016/j.tcs.2014.11.007

M3 - Article

VL - 565

SP - 63

EP - 76

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - C

ER -