Approximability of total weighted completion time with resource consuming jobs

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates.

Original languageEnglish
Pages (from-to)595-598
Number of pages4
JournalOperations Research Letters
Volume43
Issue number6
DOIs
Publication statusPublished - Nov 1 2015

Fingerprint

FPTAS
Total Weighted Completion Time
Single Machine Scheduling
Approximability
Date
Scheduling Problem
Computational complexity
NP-complete problem
Scheduling
Resources
Job resources
Replenishment
NP-hard
Non-renewable resources
Single machine scheduling

Keywords

  • Approximation algorithms
  • Non-renewable resource
  • Scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Applied Mathematics
  • Industrial and Manufacturing Engineering
  • Software

Cite this

Approximability of total weighted completion time with resource consuming jobs. / Kis, T.

In: Operations Research Letters, Vol. 43, No. 6, 01.11.2015, p. 595-598.

Research output: Contribution to journalArticle

@article{a1a4b0c77b8c4e8fb2b71c9c91157d79,
title = "Approximability of total weighted completion time with resource consuming jobs",
abstract = "In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates.",
keywords = "Approximation algorithms, Non-renewable resource, Scheduling",
author = "T. Kis",
year = "2015",
month = "11",
day = "1",
doi = "10.1016/j.orl.2015.09.004",
language = "English",
volume = "43",
pages = "595--598",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "6",

}

TY - JOUR

T1 - Approximability of total weighted completion time with resource consuming jobs

AU - Kis, T.

PY - 2015/11/1

Y1 - 2015/11/1

N2 - In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates.

AB - In this paper we study an extension of the single machine scheduling problem with the total weighted completion time objective, where there is a single non-renewable resource consumed by the jobs, having an initial stock and some additional replenishments over time. We prove that this problem is NP-hard in the strong sense, and provide an FPTAS for a special case with two supply dates.

KW - Approximation algorithms

KW - Non-renewable resource

KW - Scheduling

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

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

U2 - 10.1016/j.orl.2015.09.004

DO - 10.1016/j.orl.2015.09.004

M3 - Article

AN - SCOPUS:84943555496

VL - 43

SP - 595

EP - 598

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 6

ER -