Péter Györgyi

Learn More
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.
  • 1