FaizaSADI.pdf

Transcript

1. Faiza SADI PhD in Computer Science INSA Centre Val de Loire (France) Universit´ e Fran¸ cois Rabelais de Tours, CNRS Scheduling and control team (ERL CNRS 6305) Computer science laboratory (EA 6300) 02/07/2015
2. Outine 1 Academic Background Engineering Master PhD 2 Research Area 3 Other Experiences 4 Motivation
3. Academic Background ♣ Operational Research Engineering. Universit´ e A/Mira of Beja¨ ıa (Algeria) ♣ Master in Modelisation, Optimization, Decision and Organization (MODO). Dauphine University in Paris Final year project: internship at LIX , Polytechnique Palaiseau, Paris Title: Planning problem of the production and maintenance of EDF power plants. ♣ Phd Thesis at Tours University (defended in 5 juin 2015) Scheduling and Control Team (ERL CNRS 6305), Computer science laboratory (EA 6300) Title: Exact and Approximate Algorithms for Multi-agent Scheduling Problems on Parallel Machines Advisers: Ameur Soukhal and Jean-Charles Billaut (LI director) {ameur.soukhal,jean-charles.billaut}@univ-tours.fr Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 3 / 10
4. Some details about the thesis topic What is the multi-agent scheduling problem ? Several agents have to share the same resources, each of witch is associated with one sub-set of jobs and aims at minimizing some objective function If N is the whole set of the jobs, then each agent k is associated with (f k, Nk) The scenarios defined in the literature: competing, interfering, non-disjoint, symmetric Problems studied: competing agent + global agent (N 2, f 2) (N 1, f 1) (N , f GA) Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 4 / 10
5. Contribution and publication of the thesis 1 Complexity analysis We characterized some polynomial and NP-hard problems, for example: Polynomial: Rm|CO-GA, pmtn|ε(f GA max /f 1 max , . . . , f K max ) NP-hard: 1|CO-GA, dj = D, pj = p|ε( wj UA j / wj UB j ) (Equal size partition problem) Publications RAIRO (2014) and Discrete Optimization. (submitted in may 2015) PMS’12, ERO’13 and PMS’14 ROADEF’12 and ROADEF’13 Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 5 / 10
6. Contribution and publication of the thesis 2 Exact and approximate resolution We have been interested in four specific problems: Pm|CO-GA|(CA max , CB max ) admits a pseudo-polynomial number of Pareto solutions and its accept a FPTAS Exact Methods: dynamic programming algorithms and MILP Approximate method: heuristics and metaheuristic (NSGA-II) Publications Next submission to ”Journal of Scheduling” ILS’14 ROADEF’14 Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 6 / 10
7. Experience in teaching ♣ [2014-2015]: one year contract as a full time lecturer and research assistant at the National Institute of Applied Science (INSA) at Centre Val de Loire (France) ♣ [2011-2014]: part time lecturer in the computer science department at Polytech’Tours - France Lectures 34% Tutorial classes 33% Practical courses 33% Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 7 / 10
8. Other experiences ♣ Supervising computer science engineering projects ♣ Organization of a scientific advances day for PhD students of two laboratories (LI in Tours and LIFO in Orleans) at the University of Tours: LI-LIFO’S PHD STUDENTS DAY at Tours University https://sites.google.com/site/csltseminarslabtours/home/ phd-students-day-li-lifo ♣ Reviewing articles for : ”Journal of Scheduling” and ”Journal of Industrial Engineering International” Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 8 / 10
9. Motivation The environment will surely be one of the greatest topics Having a nice experience in an other country Meeting a new people from a new laboratory Being part of interesting project Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 9 / 10
10. Thank you for your attention Sadi Faiza (Laboratoire LI) Postdoc application 02/07/2015 10 / 10