Single machine scheduling problems with financial resource constraints: Some complexity results and properties-Reference-Cited by-同舟云学术

Single machine scheduling problems with financial resource constraints: Some complexity results and properties

Published:2011-07 Issue:1 Volume:62 Page:7-13
ISSN:0165-4896
Container-title:Mathematical Social Sciences
language:en
Short-container-title:Mathematical Social Sciences

Author:

Gafarov Evgeny R.,Lazarev Alexander A.,Werner Frank

Publisher

Elsevier BV

Subject

Statistics, Probability and Uncertainty,General Psychology,General Social Sciences,Sociology and Political Science

Reference13 articles.

1. Scheduling subject to nonrenewable-resource constraints;Carlier;Oper. Res. Lett.,1982

2. Minimizing total tardiness on one processor is NP-hard;Du;Math. Oper. Res.,1990

3. Computers and Intractability: The Guide to the Theory of NP-Completeness;Garey,1979

4. One-machine scheduling problems with resource constraints;Janiak,1986

5. Janiak, A., Potts, C.N., Tautenhahn, T., 2000. Single maschine scheduling with nonlinear resource dependencies of release times. In: Abstract 14th Workshop on Discrete Optimization. Holzhau, Germany, May 2000.

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

1. Single machine scheduling with resource constraints: Equivalence to two-machine flow-shop scheduling for regular objectives;Journal of the Operational Research Society;2023-08-10

2. Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput;WALCOM: Algorithms and Computation;2023

3. 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

4. Dynamic resource allocation and collaborative scheduling in R&D and manufacturing processes of high-end equipment with budget constraint;Optimization Letters;2022-05-09

5. 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;2022-04