Approximation schemes for parallel machine scheduling with non-renewable resources

DOI10.1016/j.ejor.2016.09.007zbMath1380.90116OpenAlexW1444022254MaRDI QIDQ1698888

Péter Györgyi, Tamás Kis

Publication date: 16 February 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/42011/1/pm_ejor.pdf

zbMATH Keywords

schedulingparallel machinesapproximation schemesnon-renewable resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ A PTAS for a resource scheduling problem with arbitrary number of parallel machines ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints ⋮ New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource

Cites Work

• Unnamed Item
• Approximability of scheduling problems with resource consuming jobs
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Exact algorithms for inventory constrained scheduling on a single machine
• Approximation schemes for single machine scheduling with non-renewable resource constraints
• Reductions between scheduling problems with non-renewable resources and knapsack problems
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
• Approximation algorithms for inventory constrained scheduling on a single machine
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Scheduling subject to nonrenewable-resource constraints
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Approximability of total weighted completion time with resource consuming jobs
• Project scheduling with inventory constraints
• Uniform parallel machine scheduling with resource consumption constraint
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration
• Parallel machine scheduling with a convex resource consumption function
• The Design of Approximation Algorithms
• Resource Management in Machine Scheduling Problems: A Survey
• Basic scheduling problems with raw material constraints
• Khachiyan’s algorithm for linear programming
• Scheduling under a Non-renewable Resource Constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Approximation schemes for parallel machine scheduling with non-renewable resources