New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints

Péter Györgyi, Tamás Kis. New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. Discrete Applied Mathematics, 311:97-109, 2022. [doi]

Abstract

Abstract is missing.