Complexity of scheduling multiprocessor tasks with prespecified processor allocations-Reference-Cited by-同舟云学术

Complexity of scheduling multiprocessor tasks with prespecified processor allocations

Published:1994-12 Issue:3 Volume:55 Page:259-272
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Hoogeveen J.A.,van de Velde S.L.,Veltman B.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference13 articles.

1. On scheduling independent tasks with dedicated resources. Program and Abstracts;Bianco;14th International Symposium Mathematical Programming, Amsterdam,1991

2. Scheduling multiprocessor tasks on three dedicated processors;Blazewicz;Inform. Process. Lett.,1992

3. Scheduling multiprocessor tasks to minimize schedule length;Blazewicz;IEEE Trans. Comput.,1986

4. Scheduling subject to resource constraints: classification and complexity;Blazewicz;Discrete Appl. Math.,1983

5. A branch-and-bound algorithm for the continuous-process task shop scheduling problem;Bozoki;AIIE Trans.,1970

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

1. Resource constraint scheduling on two dedicated machines: Application to avionics;EURO Journal on Computational Optimization;2024

2. A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors;Journal of Heuristics;2023-04-26

3. A Makespan-Optimal Schedule for Processing Jobs with Possible Operation Preemptions As an Optimal Mixed Graph Coloring;Automation and Remote Control;2023-02

4. A review of green shop scheduling problem;Information Sciences;2022-04

5. ETA-HP: an energy and temperature-aware real-time scheduler for heterogeneous platforms;The Journal of Supercomputing;2022-01-24