Approximation schemes for parallel machine scheduling with non-renewable resources
type: Item
instance of: scholarly article
title: Approximation schemes for parallel machine scheduling with non-renewable resources
zbMATH Open document ID: 1380.90116
author: Péter Györgyi
author: Tamás Kis
published in: European Journal of Operational Research
publication date: 2018-02-16T00:00:00Z
full work available at URL: pm ejor.pdf
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6839955
zbMATH Keywords: scheduling
zbMATH Keywords: parallel machines
zbMATH Keywords: non-renewable resources
zbMATH Keywords: approximation schemes
MaRDI profile type: Publication
OpenAlex ID: W1444022254
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: Khachiyan’s algorithm for linear programming
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: 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: Approximability of scheduling problems with resource consuming jobs
cites work: Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
cites work: Resource Management in Machine Scheduling Problems: A Survey
cites work: Approximability of total weighted completion time with resource consuming jobs
cites work: Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
cites work: Approximation algorithms for inventory constrained scheduling on a single machine
cites work: Project scheduling with inventory constraints
cites work: Parallel machine scheduling with a convex resource consumption function
cites work: On a resource-constrained scheduling problem with application to distributed systems reconfiguration
cites work: Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
cites work: Scheduling under a Non-renewable Resource Constraint
cites work: The Design of Approximation Algorithms
cites work: Polynomial algorithms for single machine scheduling problems with financial constraints
cites work: Uniform parallel machine scheduling with resource consumption constraint
DOI: 10.1016/J.EJOR.2016.09.007
description: scientific article; zbMATH DE number 6839955