Dr. Kacem Imed

Professor
Universite de Lorraine, France

Highest Degree
PostDoc Fellow in Computer Science from University of Paris, France

My URL
https://livedna.org/33.11547

Share this Profile

Biography

Imed KACEM is Full Professor since 2009 at the University of Lorraine, France, in Computer Science. He is the Founder and the Head of LCOMS Laboratory of the University of Lorraine since 2013 (LCOMS is the Laboratory of Design, Optimization and Modelling of Systems) after being the Head of the Computer Science Department. His scientific activity is in the Operational Research. More precisely, his contributions are related to the design of exact and approximate algorithms with a guaranteed performance for the NP-hard combinatorial problems. Such problems are mainly related to the scheduling theory. The applications are interdisciplinary and various (production, packing in electronic design, healthcare, transportation, information visualization…). His contributions have been published in referred journals (Discrete Applied Mathematics, Discrete Optimization, Journal of Combinatorial Optimization, Journal of Scheduling, JIMO, IJPE, JIM, IJPR, EJOR, IJOR, 4OR, CAIE, IJCIM, IEEE/SMC Transactions, CAOR, ...). These research activities have involved the supervision of 10 PhD theses as well as several selective projects (some of them have been funded by the ANR, the European Commission, the CNRS, …). He serves as area editor or guest editor for several journals (Computers & Industrial Engineering-Elsevier, European Journal of Industrial Engineering, RAIRO-Operations Research, AutoSoft Journal-Taylor & Francis, Journal of Systems Science and Systems Engineering-Springer,…) and as Keynote Speaker for several conferences (IEEE/CIE40, Japon (2010), FUBUTEC2011, United Kingdom (2011), IEEE/CoDIT2013, Tunisia (2013), IEEE/ICSCS2013, France (2013), CIE46, Taiwan (2016)). He chaired the program committee or the organizing committee of several international conferences (IEEE/ICSSSM06 (Troyes, 2006), IEEE/CIE’39 (Troyes, 2009), CIE’41 (California, 2011), IEEE/CoDIT’14 (Metz, 2014), CIE’45 (Metz, 2015), IEEE/CoDIT’16 (Malta, 2016)). He obtained the « Great Award of Research 2010 » from the Universities of Lorraine, the 3rd Robert Faure Award 2009 from the French Society of Operational Research and Aid Decision (ROADEF), the 2015 Steffan Schwarz Award (Best Paper Award of the European Conference ECEC’2015 in Portugal), and he has regularly the PEDR or the PES Premium (with the highest level A) since 2006.

Area of Interest:

Computer Sciences
Operational Research
Scheduling
Combinatorial Optimization
Approximation Algorithms

Selected Publications

  1. Kacem, I. and E. Levner, 2016. An Improved Approximation Scheme for Scheduling a Maintenance and Under Linear Deteriorating Jobs. J. Ind. Manage. Optim., 12: 811-817.
    Direct Link  |  

  2. Kadri, A.A., K. Labadi and I. Kacem, 2015. An integrated Petri net and GA-based approach for performance optimisation of bicycle sharing systems. Eur. J. Ind. Eng., 9: 638-663.
    CrossRef  |  

  3. Kacem, I., H. Kellerer and Y. Lanuel, 2015. Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J. Comb. Optim., 30: 403-412.
    CrossRef  |  

  4. Kacem, I., H. Kellerer and M. Seifaddini, 2015. Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim., 10.1007/s10878-015-9924-4.
    CrossRef  |  

  5. Hfaiedh, W., C. Sadfi, I. Kacem and A. Hadj-Alouane, 2015. A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Appl. Math. Comput., 252: 496-502.
    CrossRef  |  

  6. Hassan, M.A., I. Kacem, S. Martin and I.M. Osman, 2015. Genetic Algorithms for Job Scheduling in Cloud Computing. Stud. Inf. Control, 24: 387-400.
    Direct Link  |  

  7. Abdelsadek, Y., F. Herrmann, I. Kacem and B. Otjacques, 2015. Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Ind. Eng., 81: 147-157.
    CrossRef  |  

  8. Kacem, I. and H. Kellerer, 2014. Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discrete Appl. Math., 164: 154-160.
    CrossRef  |  

  9. Benziani, Y., I. Kacem, P. Laroche and A. Nagih, 2014. Exact and Heuristic Methods for Minimizing the Total Completion Time in Job-shops. Stud. Inf. Control, 23: 31-40.
    Direct Link  |  

  10. Rebai, M., I. Kacem and K.H. Adjallah, 2013. Scheduling jobs and maintenance activities on parallel machines. Oper. Res., 13: 363-383.
    CrossRef  |  

  11. Mellouli, R., I. Kacem, C. Sadfi and C. Chu, 2013. Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCi scheduling problem. Appl. Math. Comput., 219: 10783-10805.
    CrossRef  |  

  12. Kacem, I., 2013. Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems. In: Metaheuristics for Production Scheduling. Jarboui, B., P. Siarry and J. Teghem (Eds.). John Wiley & Sons, Inc., Hoboken, NJ. USA., pp 19-44.
    CrossRef  |  

  13. Kacem, I. and V.T. Paschos, 2013. Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discrete. Optim., 10: 61-68.
    CrossRef  |  Direct Link  |  

  14. Rebai, M., I. Kacem and K.H. Adjallah, 2012. Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. J. Intell. Manuf., 23: 1207-1224.
    CrossRef  |  

  15. Nessah, R. and I. Kacem, 2012. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res., 39: 471-478.
    CrossRef  |  

  16. Kacem, I., N. Souayah and M. Haouari, 2012. Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO-Oper. Res., 46: 125-147.
    CrossRef  |  

  17. Kacem, I., Y. Lanuel and M. Sahnoune, 2011. Strongly fully polynomial time approximation scheme for the two-parallel capacitated machines scheduling problem. Int. J. Plann. Sched., 1: 32-41.
    CrossRef  |  

  18. Kacem, I., H. Kellerer and V.A. Strusevich, 2011. Single machine scheduling with a common due date: total weighted tardiness problems. In: Progress in Combinatorial Optimization. Mahjoub, A.R. (Ed.). Wiley-ISTE, London, United Kingdom, pp 391-421.

  19. Kacem, I. and H. Kellerer, 2011. Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Sched., 14: 257-265.
    CrossRef  |  

  20. Hasan, S.K., R. Sarker, D. Essam and I. Kacem, 2011. A DSS for job scheduling under process interruptions. Flexible Serv. Manuf. J., 23: 137-155.
    CrossRef  |  

  21. Chihaoui, F.B., I. Kacem, A.B. Hadj-Alouane, N. Dridi and N. Rezg, 2011. No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates. Int. J. Prod. Res., 49: 6273-6286.
    CrossRef  |  

  22. Mellouli, A., F. Masmoudi, I. Kacem and M. Haddar, 2010. A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. Int. J. Appl. Metaheuristic Comput., 1: 34-49.
    CrossRef  |  Direct Link  |  

  23. Kacem, I., 2010. Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discrete Applied Math., 158: 1035-1040.
    CrossRef  |  

  24. Souayah, N., I. Kacem, M. Haouari and C. Chu, 2009. Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manage., 1: 30-69.
    CrossRef  |  

  25. Mellouli, R., C. Sadfi, C. Chu and I. Kacem, 2009. Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Eur. J. Oper. Res., 197: 1150-1165.
    CrossRef  |  

  26. Kacem, I., 2009. Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim., 17: 117-133.
    CrossRef  |  

  27. Kacem, I. and M. Haouari, 2009. Approximation algorithms for single machine scheduling with one unavailability period. Q. J. Oper. Res., 7: 79-92.
    CrossRef  |  Direct Link  |  

  28. Kacem, I. and A.R. Mahjoub, 2009. Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng., 56: 1708-1712.
    CrossRef  |  

  29. Bekrar, A., I. Kacem, C. Chu and C. Sadfi, 2009. An improved heuristic and an exact algorithm for the 2D strip and bin packing problem. Int. J. Prod. Dev., 10: 217-240.
    CrossRef  |  

  30. Bekrar, A. and I. Kacem, 2009. An Exact Method for the 2D Guillotine Strip Packing Problem. Adv. Oper. Res., 10.1155/2009/732010.
    CrossRef  |  Direct Link  |  

  31. Kacem, I., C. Chu and A. Souissi, 2008. Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Comput. Oper. Res., 35: 827-844.
    CrossRef  |  

  32. Kacem, I., 2008. Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng., 54: 401-410.
    CrossRef  |  

  33. Kacem, I. and C. Chu, 2008. Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur. J. Oper. Res., 187: 1080-1089.
    CrossRef  |  

  34. Kacem, I. and C. Chu, 2008. Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Int. J. Comput. Integr. Manufac., 21: 388-395.
    CrossRef  |  

  35. Kacem, I. and C. Chu, 2008. Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint. Int. J. Prod. Econ., 112: 138-138.
    CrossRef  |  

  36. Bettayeb, B., I. Kacem and K.H. Adjallah, 2008. An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times. J. Syst. Sci. Syst. Eng., 17: 446-459.
    CrossRef  |  

  37. Zribi, N., I. Kacem, A. El Kamel and P. Borne, 2007. Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev., 37: 652-661.
    CrossRef  |  

  38. Kacem, I., 2007. Scheduling under Unavailability Constraints to Minimize Flow-time Criteria. In: Multiprocessor Scheduling: Theory and Applications. Levner, E., (Ed.). InTech, Vienna, Austria, ISBN 978-3-902613-02-8, pp 47-62.
    CrossRef  |  Direct Link  |  

  39. Bekrar, A., I. Kacem and C. Chu, 2007. A comparative study of exact algorithms for the two dimensional strip packing problem. J. Ind. Syst. Eng., 1: 151-170.
    Direct Link  |  

  40. Kacem, I., 2006. Lower Bounds for Tardiness Minimization on a Single Machine with Family Setup Times. Comput. Eng. Syst. Appl. IMACS Multiconference, 1: 1034-1039.
    CrossRef  |  

  41. Kacem, I., 2005. Flexible Job-Shop Scheduling Problems. In: Encyclopedia of Information Science and Technology. Khosrow-Pour, M. (Ed.). IGI Global, Hershey, PA, pp 1197-1200.
    CrossRef  |  Direct Link  |  

  42. Kacem, I. and P. Borne, 2004. Evaluating Schedule Performance in Flexible Job-Shop. In: Intelligent Sensory Evaluation: Methodologies and Applications. Ruan, D. and X. Zeng (Eds.). Springer Verlag, Germany, ISBN-10: 3540203249, pp 137-153.
    CrossRef  |  

  43. Dridi, M. and I. Kacem, 2004. A hybrid approach for scheduling transportation networks. Int. J. Appl. Math. Comput. Sci., 14: 397-409.
    Direct Link  |  

  44. Kacem, I., S. Hammadi and P. Borne, 2003. Fuzzy Evolutionary Approach for Multiobjective Combinatorial Optimization: Application to Scheduling Problems. In: Fuzzy Sets Based Heuristics for Optimization. Verdegay, J.L. (Ed.). Springer Berlin Heidelberg, Heidelberg, Germany, ISBN: 978-3-642-05611-6, pp 197-219.
    CrossRef  |  

  45. Kacem, I., 2003. Scheduling flexible job-shops: a worst case analysis and an evolutionary algorithm. Int. J. Comput. Intell. Appl., 3: 437-452.
    CrossRef  |  

  46. Kacem, I., S. Hammadi and P. Borne, 2002. Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simulat., 60: 245-276.
    CrossRef  |  

  47. Kacem, I., S. Hammadi and P. Borne, 2002. Flexible Job-Shop Scheduling Problems: Formulation, Lower Bounds, Encoding and Controlled Evolutionary Approach. In: Computational Intelligence in Control. Mohammadian, M., R. Sarker and X. Yao (Eds.). Idea Group Publishing, Hershey, PA, pp 234-263.
    CrossRef  |  Direct Link  |  

  48. Kacem, I., S. Hammadi and P. Borne, 2002. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE T. Syst. Man Cybernetics C., 32: 1-13.
    CrossRef  |  
Member since June, 2016