Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors

Autor: Claire Hanen, Alix Munier Kordon, Theo Pedersen

Publikováno v: Integration of Constraint Programming, Artificial Intelligence, and Operations Research
CPAIOR 2021: Integration of Constraint Programming, Artificial Intelligence, and Operations Research
CPAIOR 2021: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Jul 2021, Vienne, Austria. pp.214-230, ⟨10.1007/978-3-030-78230-6_14⟩
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030782290
CPAIOR

International audience; This paper proposes two deadline adjustment techniques for scheduling non preemptive tasks subject to precedence relations, release dates and deadlines on a limited number of processors. This decision problem is denoted by P|p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaae38ce10e874e0acf752160a824c69
https://hal.science/hal-03548213