METHOD FOR ORDERING SUCCESSIVE TASKS WHICH ARE ONLY ON TIME-LIKE CONSTRAINTS

摘要

This method essentially consists of: BR/ - constituting (E21) a first sequence in which all the tasks are ordered according to increasing tmin values; and a second sequence in which all the tasks are ordered according to increasing tmax values; BR/ - constitute (E21) an initial permutation and check (E22) that it satisfies all the constraints; BR/ - if all the constraints are not satisfied, determine (E22) in the initial permutation the first task, called misplaced, for which a constraint is not satisfied; BR/ - determine (E23, E24) in the second sequence a so-called task candidate; BR/ - check (E25, ..., E29, E22) that, if the candidate task is moved in the current permutation to be placed immediately after the misplaced task, all constraints on all the tasks as well as displaced are then satisfied.