Algorithms Research

Algorithms Research is an international peer-reviewed journal which presents papers on algorithms that are inherently discrete and finite and that have some natural mathematical content, either in their objective or in their analysis. The journal features new algorithms and data structures, new analyses or comparisons of known algorithms, complexity studies, and sharply focused review articles of subject areas that are currently active.

Imed Kacem

Editorial Board Member of Algorithms Research

Head of Academic Department/Faculty, University Paul Verlaine-Metz (UPVM), France

Research Areas

Operational Research, Scheduling, Approximation Algorithms, Combinatorial Optimization

Education

2003Ph.DEcole Centrale de Lille
2000M.ScUniversity of Lille 1, France

Experience

2009-presentFull Professor, University Paul Verlaine-Metz, France
2003-2009Associate Professor, University of Technology of Troyes, France

Academic Achievement

The 3rd 2009 ROBERT FAURE Award attributed by the French Society of Operational Research and Decision Aid
The 2010 Lorraine Universities Great Award of Research
The delegation at CNRS (French National Scientific Research Centre) over the period 2007/2008
The premium of scientific excellence since October 2006 (a selective premium attributed by the French Ministry of Research to researchers who have an excellent scientific level and a recognized quality of the PhD theses they supervised)
The inclusion in the Marquis "Who's Who in the World" since 2008
The Presidential Award 2001 for the Best Student, Tunisia

Membership

Invited Member of the MIM Faculty Council (UPV-M) since June 2010
Member of the Pedagogy Commission of MIM Faculty (UPV-M) since June 2010
Member of the Financial Commission of MIM Faculty (UPV-M) since June 2010
Member of the selection committee for Amiens University (Associate Professor position in Computer Science, year 2009)
Member of the Doctoral School Council 2007-2009 (UTT)
Member of COPIL (Supervisor Committee of UTT) 2005-2006

Publications: Journals

[1]  I. Kacem. Fully Polynomial-Time Approximation Scheme for the Weighted Total Tardiness Minimization with a Common Due Date. Discrete Applied Mathematics (ELSEVIER), 2010, 158:9, 1035-1040.
[2]  I. Kacem, H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Journal of Scheduling (SPRINGER) to appear, doi: 10.1007/s10951-009-0146-4.
[3]  I. Kacem, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. Journal of Combinatorial Optimization (SPRINGER) 2009, 17:2, 117-133.
[4]  I. Kacem, H. Kellerer, Approximation algorithms for no-idle time scheduling on a single machine with release times and delivery times. Discrete Applied Mathematics (ELSEVIER), doi:10.1016/j.dam.2011.07.005.
[5]  I. Kacem, M. Haouari, Approximation algorithms for single machine scheduling with one unavailability period. 4OR: a Quarterly Journal of Operations Research, (Springer) 2009, doi: 10.1007/s10288-008-0076-6.
[6]  I. Kacem, A.R. Mahjoub, FPTAS for the Weighted Flowtime Minimization on a Single Machine with a Fixed Non-Availability Interval. Computers & Industrial Engineering (Elsevier), 2009, 56:4, 1708-1712.
[7]  I. Kacem, Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering (Elsevier) vol 54, n°3, pp 401-401, 2008.
[8]  I. Kacem, C. Chu. Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research (Elsevier), 2008, 187:3, 1080-1089.
[9]  I. Kacem, C. Chu, A. Souissi, A. Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Computers & Operations Research, (Elsevier) 2008, 35:3, 827-844.
[10]  I. Kacem, C. Chu. Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint. International Journal of Production Economics, (Elsevier), 2008, 112:1, 138-150.
[11]  I. Kacem, C. Chu. Minimizing the weighted flowtime on a single machine with resumable availability contraint: Worst-case of the WSPT heuristic. International Journal of Computer Integrated Manufacturing, (Taylor & Francis) vol 21, Issue 4 June 2008, pp388-395.
[12]  I. Kacem. Lower bounds for tardiness minimization on a single machine with family setup times. International Journal of Operations Research, (ORSTW) 2007, 4:4, 18-31.
[13]  R. Nessah, I. Kacem. Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Computers & Operations Research (ELSEVIER), 39:3, 471-478 (2012).
[14]  M. Rebai, I. Kacem, K.H. Adjallah, Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. Journal of Integrated Manufacturing (SPRINGER) 2010, doi: 10.1007/s10845-010-0425-0.
[15]  M. Hifi, I. Kacem, S. Nègre, L. Wu. A Linear Programming Approach for the Three-Dimensional Bin-Packing Problems. Electronic Notes in Discrete Mathematics (ELSEVIER), 36: 993-1000, 2010.
[16]  M. Zaidi, B. Jarboui, I. Kacem, T. Loukil. Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electronic Notes in Discrete Mathematics (ELSEVIER), 36: 543-550, 2010.
[17]  F. Ben Chihaoui, I. Kacem, A. B. Hadj Alouane, N. Dridi. No-wait Scheduling of a Two-machine Flow-shop to Minimize the Makespan under Non-Availability Constraints and Different Release Dates. International Journal of Production Research (Taylor & Francis), 2010 (doi: 10.1080/00207543.2010.531775).
[18]  A. Mellouli, F. Masmoudi, I. Kacem, M. Haddar. A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. International Journal of Applied Metaheuristic Computing (IGI), 2010 1:2, 34-49.
[19]  A. Bekrar, I. Kacem, C. Chu, C. Sadfi. An improved heuristic and an exact algorithm for the 2D strip and bin packing problem. International Journal of Product Development 2010, 10:1/2/3, pp 217-240.
[20]  N. Souayah, I. Kacem, M. Haouari, C. Chu. Scheduling on Parallel Identical Machines to Minimize Total Weighted Tardiness. International Journal of Advanced Operations Management, (Inderscience) 2009, 1:1, 30-69.
[21]  A. Bekrar, I. Kacem. An Exact Method for the 2D Guillotine Strip Packing Problem. Advances in Operations Research 2009, Volume 2009, doi:10.1155/2009/732010.
[22]  R. Mellouli, C. Sadfi, C. Chu, I. Kacem. Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. European Journal of Operational Research, (Elsevier) 2009, 197:3, 1150-1165.
[23]  B. Bettayeb, I. Kacem, K.H. Adjallah. An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machine with family setup times. Journal of Systems Science and Systems Engineering, (Springer) 2008, 17:4, 446-459.
[24]  N. Zribi, I. Kacem, A. El-Kamel, P. Borne. Assignment and scheduling in flexible job shops by hierarchical optimization. IEEE Transactions on Systems, Man and Cybernetics, Part C, (IEEE) vol 37, n°4, pp 652-661, 2007.
[25]  A. Bekrar, I. Kacem, C. Chu. A comparative study of exact algorithms for the two dimensional strip packing problem. Journal of Industrial Systems Engineering, (IIIE) vol 1, n°2, pp 151-170, 2007.
[26]  N. Zribi, I. Kacem, A. El-Kamel, P. Borne. Minimisation de la somme des retards dans un jobshop flexible. revue e-STA (SEE), Vol 2, n°2, 2005.
[27]  M. Dridi, I. Kacem. Hybrid approach for scheduling transportation network. International Journal of Applied Mathematics and Computer Science, (ICCE) vol 14, n°3, 397-409, 2004.
[28]  I. Kacem. Scheduling flexible job-shops: a worst case analysis and an evolutionary algorithm. International Journal of Computational Intelligence and Applications, (World Scientific) vol 3, n°4, pp 437-452, 2003.
[29]  I. Kacem, S. Hammadi, P. Borne, Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computers in Simulation, (Elsevier) vol 60, pp 245-276, 2002.
[30]  I. Kacem, S. Hammadi, P. Borne. Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-shop Scheduling Problems. IEEE Transactions on Systems, Man and Cybernetics, Part C, (IEEE) vol 32, n°1, pp 1-13, 2002.
[31]  S. M. Kamrul Hasan, Ruhul Sarker, Daryl Essam, Imed Kacem. A DSS for job scheduling under process interruptions. Flexible Services and Manufacturing Journal, 2011, Volume 23, Number 2, Pages 137-155.
[32]  I. Kacem, Scheduling function for optimization and management in production and service systems. Advances in Management, vol 2, n°2, 2009.
[33]  Groupe Flexibilité du GOThA. Flexibilité et Robustesse en Ordonnancement (Article collectif). Bulletin de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, pp 1-12, juin 2002.

Publications: Conferences/Workshops/Symposiums

[1]  I. Kacem. New Fully Polynomial Time Approximation Scheme for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. Proceedings of the 9th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 25th-27th May, 2010, pp 101-104.
[2]  I. Kacem. Fully Polynomial-Time Approximation Scheme for two-parallel machines scheduling problem under unavailability Constraint. 12th LSS Symposium on large Scale Systems: Theory and Applications, 11-14 July 2010, Villeneuve d'Ascq, France. [INVITED TALK].
[3]  M. Hifi, I. Kacem, S. Negre, L. Wu. Heuristics algorithms based on a linear programming for the three-dimensional Bin-Packing problem. 12th LSS Symposium on large Scale Systems: Theory and Applications, 11-14 July 2010, Villeneuve d'Ascq, France.
[4]  M. Rebai, I. Kacem, K. Adjallah. Scheduling jobs and preventive maintenance activities on parallel machines. ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science, pp 406-411, Iwate, Japan, October 2010 (ISBN: 978-960-474-231-8). [INVITED TALK].
[5]  M. Hifi, I. Kacem. Approximation algorithms for makespan minimization on two parallel machines with release dates. IEEE/CIE39 Proceedings, 2009, page 296-299. [INVITED TALK].
[6]  C. Sadfi, I. Kacem, W. Liu. Lower bounds for total weighted completion scheduling problem with availability constraints. IEEE/CIE39 Proceedings, 2009, page 159-163.
[7]  C. Sadfi, I. Kacem, W. Liu. Total weighted completion scheduling problem with availability constraints. IEEE/CIE39 Proceedings, 2009, page 134-137.
[8]  M. Rebai, I. Kacem, K. Adjallah. New algorithm for earliness tardiness minimization on a single machine: application to a maintenance problem. IEEE/CIE39 Proceedings, 2009, page 23-27.
[9]  Rebai M, Kacem I, Adjallah K. Minimizing the Cost of Scheduling Maintenance Tasks on a Single Machine. Proceedings of ECEC' EUROSIS: The European Multidisciplinary Society for Modelling and Simulation Technology, Bruges, April 15-17, 2009, p 115-120.
[10]  I. Kacem, H. Kellerer. Approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a fixed job and release dates. IEEE/CIE39 Proceedings, 2009, page 291-295.
[11]  Rebai M, Kacem I, Adjallah K. Ordonnancement des tâches de maintenance sur une machine. Actes de LT'2009 Workshop International Logistique et Transport, Sousse, Tunisie, 22-24 mars, 2009. [INVITED TALK].
[12]  I. Kacem. Fully polynomial time approximation scheme for total weighted tardiness minimization under a common due date. Proceedings of the 38th International Conference on Computers & Industrial Engineering CIE38, pp 161-163, Oct.31--Nov.2/2008, Beijing, China.
[13]  A. Bekrar, I. Kacem. Coupes valides pour le problème de strip packing. MOSIM08, 31 mars-2 avril 2008, Paris, France.
[14]  N. Souayah, I. Kacem, M. Haouari, C. Chu. Branch and bound algorithm for total weighted tardiness minimization on parallel machines. MOSIM08, 31 mars-2 avril 2008, Paris, France.
[15]  M. Rebai, I. Kacem. Minimizing the earliness-tardiness costs on a single machine. IEEE/ICSSSM'08, 30 June-2 July 2008, Melbourne, Australia.
[16]  I. Kacem. Fully Polynomial-Time Approximation Schemes for the Flowtime Minimization Under Unavailability Constraint. LT'2007, Sousse, Tunisie, novembre 2007. [INVITED TALK].
[17]  A. Bekrar, I. Kacem, C. Chu. Exact Algorithms for the Two Dimensional Non-Guillotine Strip Packing Problem. LT'2007, Sousse, Tunisie, novembre 2007.
[18]  M. Michrafy, I. Kacem, C. Chu. Hybrid method for two-dimensional strip-packing. The 37th International Conference on computers and Industrial Engineering ICC&IE'2007, October 2007, Alexandria, Egypt.
[19]  N. Souayah, I. Kacem, C. Chu, M. Haouari. Scheduling on parallel identical machines to minimize total weighted tardiness. The 37th International Conference on computers and Industrial Engineering ICC&IE'2007, October 2007, Alexandria, Egypt.
[20]  I. Kacem, C. Chu. Worst-case bound performance of the preemptive WSPT heuristic for the problem 1,h1|pre|∑wiCi. ICSSSM'06, October 25-27, 2006, Troyes, France. [INVITED TALK].
[21]  I. Kacem, Lower bounds for tardiness minimization on a single machine with family setup times, CESA'06-October 2006-Pekin--China. [INVITED TALK].
[22]  A. Souissi, I. Kacem, C. Chu, Minimiser le retard total sur machines parallèles avec prise en compte des temps de setup. Actes des articles longs sélectionnés lors du congrès de la Roadef. ValenSiences N°5, pp 169-190, 2006.
[23]  A. Souissi, I. Kacem, C. Chu, Minimiser le makespan avec prise en compte d'indisponibilité sur une seule machine. Actes des articles longs sélectionnés lors du congrès de la Roadef. ValenSiences N°5, pp 191-206, 2006.
[24]  A. Bekrar, I. Kacem, C. Chu, C. Sadfi. A Branch and Bound Algorithm for solving the 2D Strip Packing Problem, ICSSSM'06, October 25-27, 2006, Troyes, France, pp: 940-946.
[25]  R. Mellouli, C. Sadfi, C. Chu, I. Kacem. Branch-and-Bound Method to solve the Pm,hj1||∑Ci problem, ICSSSM'06, October 25-27, 2006, Troyes, France.
[26]  B. Bettayeb, I. Kacem, K. Adjallah, An improved branch and bound for parallel machines problem with family-setups, CESA'06, October 2006, Pekin.
[27]  R. Mellouli, C. Sadfi, C. Chu, I. Kacem. Generation Column for scheduling jobs on parallel machines to minimize the total flowtime. CESA'06, October 2006, Pekin, China.
[28]  R. Mellouli, C. Sadfi, C. Chu, I. Kacem. MSPT2 Heuristic and Dynamic Programming Method for the Parallel Machine Scheduling Problem with scheduled Preventive Maintenance, ICSSSM'06, October 25-27, 2006, Troyes, France.
[29]  R. Nessah, C. Chu, F. Yalaoui, I. Kacem. A Branch and bound for 1|ri|∑wiCi scheduling problem. CESA'06, October 2006, Pekin, China.
[30]  I. Kacem, C. Chu. A. Souissi. Minimizing the weighted sum of completion times with availability constraints: comparison of a branch and bound method and an integer linear programming. IESM'05, 16-19 Mai 2005, Marrakech, Maroc.
[31]  I. Kacem, C. Chu. Worst case analysis of WSPT and MWSPT for 1,h1||∑wiCi. IESM'05, 16-19 Mai 2005, Marrakech, Maroc.
[32]  I. Kacem, C. Sadfi, A. Elkamel, Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints, IEEE/SMC'05, October, 2005, Hawaï, USA.
[33]  I. Kacem, C. Sadfi, A. Elkamel, Exact Approaches to Minimize the Total Completion Times on a Single Machine with Availability Constraints, IEEE/ACIDCA'05, November, 2005, Douz, Tunisia.
[34]  A. Souissi, I. Kacem, C. Chu, Minimizing Total Tardiness on a Single Machine with Sequence-Dependent Setup Times. IEEE/SMC'04 October 10-13, 2004 The Hague.
[35]  N. Zribi, I. Kacem, A. El-Kamel, P. Borne, Optimization by phases for the flexible job-shops scheduling problem, ASCC'2004 Melbourne, Australia 20-23 July 2004.
[36]  N. Zribi, I. Kacem, A. El-Kamel, Hierarchical Optimization For The Flexible Job-Shops Scheduling Problem, INCOM'04, Salvador, Brazil 5-7 April, 2004.
[37]  N. Zribi, I. Kacem, A. El-Kamel et P. Borne. Minimisation de la somme des retards dans un jobshop flexible. CIFA'04, 20-24 novembre 2004, Douz, Tunisie.
[38]  N. Zribi, I. Kacem, A. El-Kamel. Coopération entre méthodes exactes et métaheuristiques pour minimiser la somme des retards dans un jobshop flexible. MOSIM'04, 1-4 septembre 2004, Nantes.
[39]  I. Kacem, Genetic Algorithm for the Flexible Job-shop Scheduling Problem, IEEE/SMC'03, October 5--8, 2003, Washington, D.C., USA.
[40]  I. Kacem, S. Hammadi, P. Borne, Bornes Inférieures pour les Problèmes d'Ordonnancement des Job-shop Flexibles, CIFA'02, pp 247-253, Nantes, July 8-10, 2002, France.
[41]  I. Kacem, S. Hammadi, P. Borne, Approach by Localization and Genetic Manipulations Algorithm for Flexible Job-Shop Scheduling Problem, IEEE/SMC'01, pp 2599-2604, October 7-9, 2001, Tucson, USA.
[42]  I. Kacem, S. Hammadi, P. Borne, Direct Chromosome Representation and Advanced Genetic Operators for Job-shop Problems, CIMCA'01, pp 123-131, 9-11 July 2001, Las Vegas, USA.

Publications: Books/Book Chapters

[1]  I. Kacem. Modelling flexible job shop scheduling problems. Chapter in Encyclopedia of Information Science and Technology. Idea Group Publishing, 2005, USA.
[2]  I. Kacem. Scheduling under unavailability constraints to minimize flowtime criteria. Chapter in Multiprocessor Scheduling: Theory and Applications (Edited by E. Levner). ISBN 978-3-902613-02-8, ARS Publishing, 2007.
[3]  I. Kacem, P. Borne. Fuzzy Hybrid Method for Evaluating Schedule Performance in Flexible Job-Shop. Chapter in Intelligent Sensory Evaluation: Methodologies and Applications, pp 137-154. Springer Verlag, 2004.
[4]  I. Kacem, S. Hammadi, P. Borne. Flexible Job-shop Scheduling Problems: Formulation, Lower-bounds, Encodings, and Controlled Evolutionary Approach. Chapter in Computational Intelligence in Control, pp 233-261, Idea Group Publishing, USA, 2002.
[5]  I. Kacem, S. Hammadi, P. Borne. Fuzzy Evolutionary Approach for Multi-objective Combinatorial Optimization: Application to Scheduling Problems. Chapter in Fuzzy Sets-based Heuristics for Optimization, Springer Verlag, 2003.