An integrated greedy heuristic for a flexible job shop scheduling problem. - Yazid Mati; Nidhal Rezg; Xiaolan Xie (SMC, 2001)

A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. - Antoine Landrieu; Yazid Mati; Zdenek Binder (J. Intell. Manuf., 2001)

A taboo search approach for deadlock-free scheduling of automated manufacturing systems. - Yazid Mati; Nidhal Rezg; Xiaolan Xie (J. Intell. Manuf., 2001)

Geometric approach and taboo search for scheduling flexible manufacturing systems. - Yazid Mati; Nidhal Rezg; Xiaolan Xie (IEEE Trans. Robotics Autom., 2001)

A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility. - Yazid Mati; Xiaolan Xie (ICRA, 2003)

The complexity of two-job shop problems with multi-purpose unrelated machines. - Yazid Mati; Xiaolan Xie (Eur. J. Oper. Res., 2004)

Complexity of flowshop scheduling problems with a new blocking constraint. - S. Martinez; Stéphane Dauzère-Pérès; Christelle Guéret; Yazid Mati; Nathalie Sauer (Eur. J. Oper. Res., 2006)

A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. - Imen Essafi; Yazid Mati; Stéphane Dauzère-Pérès (Comput. Oper. Res., 2008)

Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability. - Yazid Mati (Comput. Ind. Eng., 2010)

A general approach for optimizing regular criteria in the job-shop scheduling problem. - Yazid Mati; Stéphane Dauzère-Pérès; Chams Lahlou (Eur. J. Oper. Res., 2011)

Multiresource Shop Scheduling With Resource Flexibility and Blocking. - Yazid Mati; Xiaolan Xie (IEEE Trans Autom. Sci. Eng., 2011)

An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. - Andrés Alberto García-León; Stéphane Dauzère-Pérès; Yazid Mati (Comput. Oper. Res., 2019)