REAL

Approximability of total weighted completion time with resource consuming jobs

Kis, Tamás (2015) Approximability of total weighted completion time with resource consuming jobs. Operations Research Letters, 43. 595-598. ISSN 0167-6377

This is the latest version of this item.

[img]
Preview
Text
weighted_compl_rev2.pdf

Download (251kB) | Preview

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

Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Depositing User: Dr. Tamás Kis
Date Deposited: 26 Dec 2015 16:35
Last Modified: 04 Apr 2023 11:19
URI: http://real.mtak.hu/id/eprint/31338

Available Versions of this Item

Actions (login required)

Edit Item Edit Item