The following pages link to Alix Munier Kordon (Q337139):
Displayed 27 items.
- Converging to periodic schedules for cyclic scheduling problems with resources and deadlines (Q337140) (← links)
- (Q429653) (redirect page) (← links)
- Complexity results for weighted timed event graphs (Q429654) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Periodic schedules for linear precedence constraints (Q1003670) (← links)
- A sufficient condition for the liveness of weighted event graphs (Q1014950) (← links)
- Minimizing place capacities of weighted event graphs for enforcing liveness (Q1020558) (← links)
- The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan (Q1043332) (← links)
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- A buffer minimization problem for the design of embedded systems (Q1767685) (← links)
- Minimizing the volume in scheduling an out-tree with communication delays and duplication. (Q1853241) (← links)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors (Q2117220) (← links)
- Memory management optimization problems for integrated circuit simulators (Q2383536) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
- Scheduling an interval ordered precedence graph with communication delays and a limited number of processors (Q2845034) (← links)
- On the Reversibility of Live Equal-Conflict Petri Nets (Q2941153) (← links)
- Scheduling on Two Unbounded Resources with Communication Costs (Q3297565) (← links)
- A polynomial algorithm for minDSC on a subclass of series Parallel graphs (Q3632806) (← links)
- (Q4553437) (← links)
- On Liveness and Reversibility of Equal-Conflict Petri Nets (Q4976374) (← links)
- A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors (Q5053913) (← links)
- On the Reversibility of Well-Behaved Weighted Choice-Free Systems (Q5166772) (← links)
- Periodic Schedules for Bounded Timed Weighted Event Graphs (Q5352813) (← links)
- A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays (Q6484558) (← links)