Jean-Louis Bouquard

According to our database1, Jean-Louis Bouquard authored at least 15 papers between 2002 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Matheuristic algorithms for minimizing total tardiness in the <i>m</i>-machine flow-shop scheduling problem.
J. Intell. Manuf., 2018

2016
Scheduling evacuation operations.
J. Sched., 2016

2015
Enumeration of Pareto Optima for a Bicriteria Evacuation Scheduling Problem.
Proceedings of the ICORES 2015, 2015

2014
Heuristics for Scheduling Evacuation Operations in Case of Natural Disaster.
Proceedings of the ICORES 2014, 2014

2013
An hybrid metaheuristic, an hybrid lower bound and a Tabu search for the two-machine flowshop total tardiness problem.
Proceedings of the 2013 IEEE RIVF International Conference on Computing and Communication Technologies, 2013

2007
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria.
INFORMS J. Comput., 2007

Genetic Branch-and-Bound or Exact Genetic Algorithm?.
Proceedings of the Artificial Evolution, 2007

2006
Application of an optimization problem in Max-Plus algebra to scheduling problems.
Discret. Appl. Math., 2006

Two-machine flow shop scheduling problems with minimal and maximal delays.
4OR, 2006

2005
New Single Machine and Job-Shop Scheduling Problems with Availability Constraints.
J. Sched., 2005

Two-machine flow shop scheduling problems with no-wait jobs.
Oper. Res. Lett., 2005

The e-OCEA project: towards an Internet decision system for scheduling problems.
Decis. Support Syst., 2005

Dimensioning an Inbound Call Center Using Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2003
Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan.
RAIRO Oper. Res., 2003

2002
A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint.
J. Oper. Res. Soc., 2002


  Loading...