Preemptive scheduling of independent jobs on parallel machines subject to financial constraints-Reference-Cited by-同舟云学术

Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

Published:1984-03 Issue:3 Volume:15 Page:366-373
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Slowiński Roman

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference12 articles.

1. Complexité des problémes d'ordonnancement à contraintes de financement;Carlier,1980

2. Scheduling subject to nonrenewable resource constraints;Carlier;Operations Res. Letters,1982

3. Activity Networks: Project Planning and Control by Network Models;Elmaghraby,1977

4. A polynomial algorithm in linear programming;Khachian;Dokl. Akad. Nauk SSSR,1979

5. Scheduling preemptable tasks on unrelated processors with additional resources to minimize schedule length;Slwiński,1978

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

5. Combined Optimization Algorithm of Complex Technical Object Functioning and Its Information System Modernization;System Analysis in Engineering and Control;2022