Scheduling with non-renewable resources: minimizing the sum of completion times

DOI10.1007/978-3-030-53262-8_14zbMath1458.90256arXiv1911.12138OpenAlexW3045313917MaRDI QIDQ2225062

Tamás Király, Simon Omlor, Kristóf Bérczi

Publication date: 4 February 2021

Full work available at URL: https://arxiv.org/abs/1911.12138

zbMATH Keywords

schedulingapproximation algorithmnon-renewable resourcesPTAS

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (5)

A multivariate complexity analysis of the material consumption scheduling problem ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource ⋮ 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

This page was built for publication: Scheduling with non-renewable resources: minimizing the sum of completion times