Yazid Mati

According to our database1, Yazid Mati authored at least 12 papers between 2001 and 2019.

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

2019
An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria.
Comput. Oper. Res., 2019

2011
Multiresource Shop Scheduling With Resource Flexibility and Blocking.
IEEE Trans Autom. Sci. Eng., 2011

A general approach for optimizing regular criteria in the job-shop scheduling problem.
Eur. J. Oper. Res., 2011

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

2008
A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem.
Comput. Oper. Res., 2008

2006
Complexity of flowshop scheduling problems with a new blocking constraint.
Eur. J. Oper. Res., 2006

2004
The complexity of two-job shop problems with multi-purpose unrelated machines.
Eur. J. Oper. Res., 2004

2003
A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility.
Proceedings of the 2003 IEEE International Conference on Robotics and Automation, 2003

2001
Geometric approach and taboo search for scheduling flexible manufacturing systems.
IEEE Trans. Robotics Autom., 2001

A taboo search approach for deadlock-free scheduling of automated manufacturing systems.
J. Intell. Manuf., 2001

A tabu search heuristic for the single vehicle pickup and delivery problem with time windows.
J. Intell. Manuf., 2001

An integrated greedy heuristic for a flexible job shop scheduling problem.
Proceedings of the IEEE International Conference on Systems, 2001


  Loading...