Laurent Houssin

Orcid: 0000-0001-5975-7639

According to our database1, Laurent Houssin authored at least 25 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The robust cyclic job shop problem.
Eur. J. Oper. Res., February, 2024

2023
Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem.
Comput. Oper. Res., April, 2023

Toward Radio Access Network Slicing Enforcement in Multi-cell 5G System.
J. Netw. Syst. Manag., 2023

Hybrid Methods to Solve the Two-Stage Robust Flexible Job-Shop Scheduling Problem with Budgeted Uncertainty.
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

An Efficient Constraint Programming Approach to Preemptive Job Shop Scheduling.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Properties, Extensions and Application of Piecewise Linearization for Euclidean Norm Optimization in $\mathbb {R}^2$.
J. Optim. Theory Appl., 2022

Optimisation pour l'ordonnancement et le spatial. (Optimization for scheduling problems and space technology problems).
, 2022

2021
MILP formulation improvement with <i>k</i>-means clustering for the beam layout optimization in multibeam satellite systems.
Comput. Ind. Eng., 2021

2020
A mixed integer linear programming modelling for the flexible cyclic jobshop problem.
Ann. Oper. Res., 2020

2019
Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design.
Comput. Optim. Appl., 2019

2018
A robust basic cyclic scheduling problem.
EURO J. Comput. Optim., 2018

A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

Algorithms for the flexible cyclic jobshop problem.
Proceedings of the 14th IEEE International Conference on Automation Science and Engineering, 2018

2016
Mixed-integer linear programming for multibeam satellite systems design: Application to the beam layout optimization.
Proceedings of the Annual IEEE Systems Conference, 2016

2015
A Comparison of a Global Approach and a Decomposition Method for Frequency Assignment in Multibeam Satellite Systems.
Proceedings of the Operations Research and Enterprise Systems, 2015

A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems .
Proceedings of the ICORES 2015, 2015

An exension of the heap of pieces model for the Cyclic Jobshop Problem.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

2014
A greedy approach combined with graph coloring for non-uniform beam layouts under antenna constraints in multibeam satellite systems.
Proceedings of the 7th Advanced Satellite Multimedia Systems Conference and the 13th Signal Processing for Space Communications Workshop, 2014

2013
Control of (max, +)-linear systems minimizing delays.
Discret. Event Dyn. Syst., 2013

Frequency assignment in a SDMA satellite communication system with beam decentring feature.
Comput. Optim. Appl., 2013

2012
Frequency allocation in a SDMA satellite communication system with beam moving.
Proceedings of IEEE International Conference on Communications, 2012

2011
Frequency allocation problem in a SDMA satellite communication system.
Comput. Ind. Eng., 2011

2007
Just in Time Control of Constrained ( <i>max</i> , +)-Linear Systems.
Discret. Event Dyn. Syst., 2007

2003
Modelling of Urban Bus Networks in Dioids Algebra.
Proceedings of the Positive Systems, 2003


  Loading...