Yazid Mati

12 papers A* 1B 1Journal 10
YearRankTypeTitle / Venue / Authors
2019 J jnl
An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria.
Comput. Oper. Res.
Andrés Alberto García-León, Stéphane Dauzère-Pérès, Yazid Mati
2011 J jnl
A general approach for optimizing regular criteria in the job-shop scheduling problem.
Eur. J. Oper. Res.
Yazid Mati, Stéphane Dauzère-Pérès, Chams Lahlou
2011 J jnl
Multiresource Shop Scheduling With Resource Flexibility and Blocking.
IEEE Trans Autom. Sci. Eng.
Yazid Mati, Xiaolan Xie
2010 J jnl
Minimizing the makespan in the non-preemptive job-shop scheduling with limited machine availability.
Comput. Ind. Eng.
Yazid Mati
2008 J jnl
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem.
Comput. Oper. Res.
Imen Essafi, Yazid Mati, Stéphane Dauzère-Pérès
2006 J jnl
Complexity of flowshop scheduling problems with a new blocking constraint.
Eur. J. Oper. Res.
S. Martinez, Stéphane Dauzère-Pérès, Christelle Guéret, Yazid Mati, Nathalie Sauer
2004 J jnl
The complexity of two-job shop problems with multi-purpose unrelated machines.
Eur. J. Oper. Res.
Yazid Mati, Xiaolan Xie
2003 A* conf
A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility.
ICRA
Yazid Mati, Xiaolan Xie
2001 J jnl
A taboo search approach for deadlock-free scheduling of automated manufacturing systems.
J. Intell. Manuf.
Yazid Mati, Nidhal Rezg, Xiaolan Xie
2001 J jnl
A tabu search heuristic for the single vehicle pickup and delivery problem with time windows.
J. Intell. Manuf.
Antoine Landrieu, Yazid Mati, Zdenek Binder
2001 B conf
An integrated greedy heuristic for a flexible job shop scheduling problem.
SMC
Yazid Mati, Nidhal Rezg, Xiaolan Xie
2001 J jnl
Geometric approach and taboo search for scheduling flexible manufacturing systems.
IEEE Trans. Robotics Autom.
Yazid Mati, Nidhal Rezg, Xiaolan Xie