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

Györgyi, Péter and Kis, Tamás (2022) 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. pp. 97-109. ISSN 0166-218X 10.1016/j.dam.2022.01.009

[img]
Preview
Text
Gyorgyi_97_32716122_ny.pdf

Download (488kB) | Preview
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 29 May 2022 07:16
Last Modified: 11 Sep 2023 15:10
URI: https://eprints.sztaki.hu/id/eprint/10332

Update Item Update Item