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

Györgyi, Péter and Kis, Tamás (2015) Reductions between scheduling problems with non-renewable resources and knapsack problems. THEORETICAL COMPUTER SCIENCE, 565. pp. 63-76. ISSN 0304-3975 10.1016/j.tcs.2014.11.007

[img] Text
Gyorgyi_63_2920410_z.pdf
Restricted to Registered users only

Download (481kB) | Request a copy

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. (C) 2014 Elsevier B.V. All rights reserved.

Item Type: Article
Uncontrolled Keywords: Scheduling; SCHEDULING PROBLEM; Non-renewable resource; Intermediate product; Inapproximability; Approximation-preserving reductions; Combinatorial optimization; Approximation algorithms; Scheduling problems; Knapsack problems; Approximation preserving reductions
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 20 Nov 2015 20:46
Last Modified: 21 Nov 2016 10:42
URI: http://eprints.sztaki.hu/id/eprint/8419

Update Item Update Item