Approximation schemes for single machine scheduling with non-renewable resource constraints

DOI10.1007/s10951-013-0346-9zbMath1297.90045OpenAlexW2170793368MaRDI QIDQ398908

Péter Györgyi, Tamás Kis

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/26101/1/mat_v1.pdf

zbMATH Keywords

approximation schemessingle machine schedulingnon-renewable resources

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Interweaving real-time jobs with energy harvesting to maximize throughput ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ A PTAS for a resource scheduling problem with arbitrary number of parallel machines ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Approximability of total weighted completion time with resource consuming jobs ⋮ Minimizing 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 ⋮ An FPTAS of minimizing total weighted completion time on single machine with position constraint ⋮ Approximability of scheduling problems with resource consuming jobs

Cites Work

• Unnamed Item
• Exact algorithms for inventory constrained scheduling on a single machine
• 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
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling subject to nonrenewable-resource constraints
• Project scheduling with inventory constraints
• Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times
• Basic scheduling problems with raw material constraints
• Scheduling under a Non-renewable Resource Constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

This page was built for publication: Approximation schemes for single machine scheduling with non-renewable resource constraints