The following pages link to Cyril Briand (Q325425):
Displayed 15 items.
- Finding stable flows in multi-agent networks under an equal-sharing policy (Q325426) (← links)
- Fast minimum float computation in activity networks under interval uncertainty (Q398844) (← links)
- A robust approach for the single machine scheduling problem (Q835547) (← links)
- The resource-constrained activity insertion problem with minimum and maximum time lags (Q1041351) (← links)
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem (Q1707826) (← links)
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times (Q2018940) (← links)
- Nash equilibrium solutions in multi-agent project scheduling with milestones (Q2031069) (← links)
- Price of anarchy and price of stability in multi-agent project scheduling (Q2288992) (← links)
- A new sufficient condition of optimality for the two-machine flowshop problem (Q2572845) (← links)
- Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations (Q2670471) (← links)
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds (Q2845031) (← links)
- Inventory Routing with Explicit Energy Consumption: A Mass-Flow Formulation and First Experimentation (Q2980176) (← links)
- A new<i>any-order</i>schedule generation scheme for resource-constrained project scheduling (Q3398590) (← links)
- Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game (Q4565775) (← links)
- An efficient ILP formulation for the single machine scheduling problem (Q5189883) (← links)