Approximation schemes for single machine scheduling with non-renewable resource constraints

Authors:
Péter Györgyi;Tamás Kis
Affiliations:
Department of Operations Research, Loránd Eötvös University, Budapest, Hungary 1117;Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary 1111
Venue:
Journal of Scheduling
Year:
2014

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
Scheduling subject to nonrenewable-resource constraints

Operations Research Letters
Exact algorithms for inventory constrained scheduling on a single machine

Journal of Scheduling
Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss exact and approximation algorithms for scheduling a single machine with additional non-renewable resource constraints. Given the initial stock levels of some non-renewable resources (e.g., raw materials, fuel, money), and time points along with replenishment quantities, a set of resource consuming jobs has to be scheduled on the machine such that there are enough resources for starting each job, and the makespan is minimized. We show that the problem admits a pseudo-polynomial time algorithm when the number of replenishments is not part of the input, and also present an FPTAS when there is only a single resource, and it is replenished only once. We also describe a PTAS for the problem with a constant number of replenishments.