Scheduling subject to nonrenewable-resource constraints-Reference-Cited by-同舟云学术

Scheduling subject to nonrenewable-resource constraints

Published:1982-04 Issue:2 Volume:1 Page:52-55
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Carlier J.,Rinnooy Kan A.H.G.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference5 articles.

1. Scheduling with applications to register allocation and deadlock problems;Abdel-Wahab,1976

2. The Design and Analysis of Computer Algorithms;Aho,1974

3. Complexité des problèmes d'ordonnancements à contraintes de financement;Carlier,1980

4. Computational complexity of discrete optimization problems;Lenstra;Ann. Discrete Math.,1979

5. R. Słowinski, “Multiobjective network scheduling with efficient use of renewable and non-renewable resources”, Technical Paper, Institute of Control Engineering, Poznán, Poland.

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

1. Scheduling with non-renewable resources: minimizing the sum of completion times;Journal of Scheduling;2024-03-24

2. EPTAS for load balancing problem on parallel machines with a non-renewable resource;Discrete Optimization;2023-05

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

4. Polynomial algorithms for some scheduling problems with one nonrenewable resource;RAIRO - Operations Research;2021-11

5. A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource;Journal of Scheduling;2021-04-02