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

Péter Györgyi, T. Kis

Research output: Contribution to journalArticle

11 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)135-144
Number of pages10
JournalJournal of Scheduling
Volume17
Issue number2
DOIs
Publication statusPublished - Apr 2014

Fingerprint

Approximation algorithms
Raw materials
Scheduling
Polynomials
Approximation
Non-renewable resources
Resource constraints
Single machine scheduling
Replenishment
Resources

Keywords

  • Approximation schemes
  • Non-renewable resources
  • Single machine scheduling

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Engineering(all)
  • Management Science and Operations Research

Cite this

Approximation schemes for single machine scheduling with non-renewable resource constraints. / Györgyi, Péter; Kis, T.

In: Journal of Scheduling, Vol. 17, No. 2, 04.2014, p. 135-144.

Research output: Contribution to journalArticle

@article{463c527e9b7541589638f63994f2459b,
title = "Approximation schemes for single machine scheduling with non-renewable resource constraints",
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.",
keywords = "Approximation schemes, Non-renewable resources, Single machine scheduling",
author = "P{\'e}ter Gy{\"o}rgyi and T. Kis",
year = "2014",
month = "4",
doi = "10.1007/s10951-013-0346-9",
language = "English",
volume = "17",
pages = "135--144",
journal = "Journal of Scheduling",
issn = "1094-6136",
publisher = "Springer New York",
number = "2",

}

TY - JOUR

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

AU - Györgyi, Péter

AU - Kis, T.

PY - 2014/4

Y1 - 2014/4

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

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

KW - Approximation schemes

KW - Non-renewable resources

KW - Single machine scheduling

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

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

U2 - 10.1007/s10951-013-0346-9

DO - 10.1007/s10951-013-0346-9

M3 - Article

AN - SCOPUS:84894643791

VL - 17

SP - 135

EP - 144

JO - Journal of Scheduling

JF - Journal of Scheduling

SN - 1094-6136

IS - 2

ER -