New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints-Reference-Cited by-同舟云学术

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

Published:2022-04 Issue: Volume:311 Page:97-109
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Györgyi Péter^ORCID,Kis Tamás^ORCID

Funder

National Research, Development and Innovation Office

Hungarian Academy of Sciences

NKFIH

Nemzeti Kutatási Fejlesztési és Innovációs Hivatal

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference21 articles.

1. Scheduling start time dependent jobs to minimize the total weighted completion time;Bachman;J. Oper. Res. Soc.,2002

2. Scheduling with non-renewable resources: Minimizing the sum of completion times;Bérczi,2020

3. ProblÈmes D’Ordonnancements À Contraintes De Ressources: Algorithmes Et ComplexitÉ. ThÈse D’État;Carlier,1984

4. Scheduling supply chain node with fixed component arrivals and two partially flexible deliveries;Carrera,2010

5. Single machine scheduling problems with financial resource constraints: Some complexity results and properties;Gafarov;Math. Social Sci.,2011

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A multivariate complexity analysis of the material consumption scheduling problem;Journal of Scheduling;2023-01-14

2. A 3-APPROXIMATION LIST SCHEDULING ALGORITHM FOR A SINGLE-MACHINE SCHEDULING PROBLEM WITH A NON-RENEWABLE RESOURCE AND TOTAL WEIGHTED COMPLETION TIME CRITERION;Journal of the Operations Research Society of Japan;2022-10-31