Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates. - Zhen Liu 001; Eric Sanlaville (Discret. Appl. Math., 1995)

Nearly on Line Scheduling of Preemptive Independent Tasks. - Eric Sanlaville (Discret. Appl. Math., 1995)

Stochastic Scheduling with Variable Profile and Precedence Constraints. - Zhen Liu 001; Eric Sanlaville (SIAM J. Comput., 1997)

Machine Scheduling with Availability Constraints. - Eric Sanlaville; Günter Schmidt 002 (Acta Informatica, 1998)

Scheduling with Communication Delays and On-Line Disturbances. - Aziz Moukrim; Eric Sanlaville; Frédéric Guinand (Euro-Par, 1999)

Parallel Machine Scheduling with Uncertain Communication Delays. - Aziz Moukrim; Eric Sanlaville; Frédéric Guinand (RAIRO Oper. Res., 2003)

Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption. - Emmanuel Poder; Nicolas Beldiceanu; Eric Sanlaville (Eur. J. Oper. Res., 2004)

Sensitivity analysis of tree scheduling on two machines with communication delays. - Frédéric Guinand; Aziz Moukrim; Eric Sanlaville (Parallel Comput., 2004)

Sensitivity bounds for machine scheduling with uncertain communication delays. - Eric Sanlaville (J. Sched., 2005)

Linear programming based algorithms for preemptive and non-preemptive RCPSP. - Jean Damay; Alain Quilliot; Eric Sanlaville (Eur. J. Oper. Res., 2007)

Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results. - Jean Damay; Alain Quilliot; Eric Sanlaville (RAIRO Oper. Res., 2008)

A polynomial algorithm for recognizing the Am-order class. - Aziz Moukrim; Eric Sanlaville (Discret. Math., 2009)

Fair resource allocation for different scenarios of demands. - Emmanuel Medernach; Eric Sanlaville (Eur. J. Oper. Res., 2012)

The Behavior of Load Balancing Strategies with Regard to the Network Structure in Distributed Computing Systems. - Mahdi Abed Salman; Cyrille Bertelle; Eric Sanlaville (SITIS, 2014)

Management of dangerous goods in container terminal with MAS model. - Mansoriya Hamidou; Dominique Fournier; Eric Sanlaville; Frédéric Serin (CoRR, 2014)

Estimation of the fault occurrence dates in DESs with partially observed stochastic Petri nets. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (ADHS, 2015)

Faults prognosis using partially observed stochastic Petri nets. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (WODES, 2016)

Fault prognosis of timed stochastic discrete event systems with bounded estimation error. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (Autom., 2017)

State estimation of discrete event systems for RUL prediction issue. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (Int. J. Prod. Res., 2017)

Faults prognosis using partially observed stochastic Petri-nets: an incremental approach. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (Discret. Event Dyn. Syst., 2018)

Towards a Novel Cooperative Logistics Information System Framework. - Fares Zaidi; Laurent Amanton; Eric Sanlaville (CoRR, 2019)

The stochastic discrete berth allocation problem. - Xavier Schepler; Nabil Absi; Dominique Feillet; Eric Sanlaville (EURO J. Transp. Logist., 2019)

Datation of Faults for Markovian Stochastic DESs. - Rabah Ammour; Edouard Leclercq; Eric Sanlaville; Dimitri Lefebvre (IEEE Trans. Autom. Control., 2019)

A Method for Estimating the Computational Complexity of Multimodal Functions. - Juan Luis Jiménez Laredo; Juan Julián Merelo Guervós; Carlos M. Fernandes 001; Eric Sanlaville (EvoApplications, 2020)

Selecting algorithms for large berth allocation problems. - Jakub Wawrzyniak; Maciej Drozdowski; Eric Sanlaville (Eur. J. Oper. Res., 2020)

A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. - Mathilde Vernet; Maciej Drozdowski; Yoann Pigné; Eric Sanlaville (Discret. Appl. Math., 2021)

A container ship traffic model for simulation studies. - Jakub Wawrzyniak; Maciej Drozdowski; Eric Sanlaville (Int. J. Appl. Math. Comput. Sci., 2022)

Framework of algorithm portfolios for strip packing problem. - Kamil Piechowiak; Maciej Drozdowski; Eric Sanlaville (Comput. Ind. Eng., 2022)

Cops and Robbers on Dynamic Graphs: Offline and Online Case. - Stefan Balev; Juan Luis Jiménez Laredo; Ioannis Lamprou 001; Yoann Pigné; Eric Sanlaville (Discret. Math. Theor. Comput. Sci., 2023)

A study of connectivity on dynamic graphs: computing persistent connected components. - Mathilde Vernet; Yoann Pigné; Eric Sanlaville (4OR, 2023)

Brief Announcement: The Dynamic Steiner Tree Problem: Definitions, Complexity, Algorithms. - Stefan Balev; Yoann Pigné; Eric Sanlaville; Mathilde Vernet (SAND, 2024)

On Inefficiently Connecting Temporal Networks. - Esteban Christiann; Eric Sanlaville; Jason Schoeters (SAND, 2024)

Temporally connected components. - Stefan Balev; Eric Sanlaville; Jason Schoeters (Theor. Comput. Sci., 2024)

Quay partitioning problem. - Jakub Wawrzyniak; Maciej Drozdowski; Eric Sanlaville; Yoann Pigné; Frédéric Guinand (Int. Trans. Oper. Res., 2024)

A temporal graph model to study the dynamics of collective behavior and performance in team sports: an application to basketball. - Quentin Bourgeais; Rodolphe Charrier; Eric Sanlaville; Ludovic Seifert (Soc. Netw. Anal. Min., 2024)

Brief Announcement: The Shortest Temporal Exploration Problem. - Stefan Balev; Eric Sanlaville; Antoine Toullalan (SAND, 2025)

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels. - Quentin Bourgeais; Rodolphe Charrier; Eric Sanlaville; Ludovic Seifert (CoRR, 2025)