Approximability of total weighted completion time with resource consuming jobs
type: Item
instance of: scholarly article
title: Approximability of total weighted completion time with resource consuming jobs
zbMATH Open document ID: 1408.90133
author: Tamás Kis
published in: Operations Research Letters
publication date: 2018-09-28T00:00:00Z
full work available at URL: weighted compl rev2.pdf
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6945419
zbMATH Keywords: scheduling
zbMATH Keywords: approximation algorithms
zbMATH Keywords: non-renewable resource
MaRDI profile type: Publication
OpenAlex ID: W1747656568
cites work: Handbook on Scheduling
cites work: Complexity of single machine scheduling subject to nonnegative inventory constraints
cites work: Exact algorithms for inventory constrained scheduling on a single machine
cites work: Q3425131
cites work: Scheduling subject to nonrenewable-resource constraints
cites work: Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
cites work: Single machine scheduling problems with financial resource constraints: some complexity results and properties
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Basic scheduling problems with raw material constraints
cites work: Approximation schemes for single machine scheduling with non-renewable resource constraints
cites work: Reductions between scheduling problems with non-renewable resources and knapsack problems
cites work: Structure of a simple scheduling polyhedron
DOI: 10.1016/J.ORL.2015.09.004
description: scientific article; zbMATH DE number 6945419