Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines

Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines

0.00 Avg rating—0 Votes
Article ID: iaor20051062
Country: Netherlands
Volume: 32
Issue: 4
Start Page Number: 326
End Page Number: 330
Publication Date: Jul 2004
Journal: Operations Research Letters
Authors: , ,
Keywords: scheduling
Abstract:

We investigate classical satisfiability tests for P|ri,di|−. Our motivation is to use the complementarity of classical preemptive relaxation and energetic reasoning. Thus minimum capacity constraints, based on the notion of mandatory parts of activities, are added to the classical max-flow formulation.

Reviews

Required fields are marked *. Your email address will not be published.