Approximation schemes for single machine scheduling with non-renewable resource constraints
type: Item
instance of: scholarly article
title: Approximation schemes for single machine scheduling with non-renewable resource constraints
zbMATH Open document ID: 1297.90045
author: Péter Györgyi
author: Tamás Kis
published in: Journal of Scheduling
publication date: 2014-08-18T00:00:00Z
full work available at URL: mat v1.pdf
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6331196
zbMATH Keywords: single machine scheduling
zbMATH Keywords: non-renewable resources
zbMATH Keywords: approximation schemes
MaRDI profile type: Publication
OpenAlex ID: W2170793368
cites work: Scheduling subject to resource constraints: Classification and complexity
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: Scheduling subject to nonrenewable-resource constraints
cites work: Scheduling under a Non-renewable Resource Constraint
cites work: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
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: Q4198056
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Basic scheduling problems with raw material constraints
cites work: Project scheduling with inventory constraints
cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
DOI: 10.1007/S10951-013-0346-9
description: scientific article; zbMATH DE number 6331196