A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints-Reference-Cited by-同舟云学术

A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints

Published:1989-11 Issue:2 Volume:43 Page:225-230
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chretienne Philippe

Publisher

Elsevier BV

Subject

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

Reference8 articles.

1. Computer and Jobshop Scheduling Theory;Coffman,1976

2. Machine scheduling problems: Classification, complexity and computation;Rinnooy Kan,1976

3. Problèmes d'ordonnancement è contraintes de ressources: Algorithmes et Complexité;Carlier,1984

4. Heuristic models of task assignment scheduling in distributed systems;Efe;Computer,1982

5. Heuristic algorithms for task assignment in distributed systems;Lo,1984

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

1. A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization;INFORMS Journal on Computing;2024-03-12

2. A Convex Reformulation and an Outer Approximation for a Large Class of Binary Quadratic Programs;Operations Research;2023-03

3. Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints;Computers & Operations Research;2021-08

4. Optimal load scheduling for off-grid photovoltaic installations with fixed energy requirements and intrinsic constraints;Process Safety and Environmental Protection;2021-05

5. A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays;Euro-Par 2021: Parallel Processing;2021