Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem. - Imed Kacem; Slim Hammadi; Pierre Borne (SMC, 2001)

Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs). - Imed Kacem; Slim Hammadi; Pierre Borne (SMC (2), 2002)

Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. - Imed Kacem; Slim Hammadi; Pierre Borne (Math. Comput. Simul., 2002)

Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. - Imed Kacem; Slim Hammadi; Pierre Borne (IEEE Trans. Syst. Man Cybern. Part C, 2002)

Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems". - Imed Kacem; Slim Hammadi; Pierre Borne (IEEE Trans. Syst. Man Cybern. Part C, 2002)

Genetic algorithm for the flexible job-shop scheduling problem. - Imed Kacem (SMC, 2003)

Scheduling Flexible Job-Shops: A Worst Case Analysis And An Evolutionary Algorithm. - Imed Kacem (Int. J. Comput. Intell. Appl., 2003)

Minimizing total tardiness on a single machine with sequence-dependent setup times. - Ahmed Souissi; Imed Kacem; Chengbin Chu (SMC (2), 2004)

Flexible Job-Shop Scheduling Problems. - Imed Kacem (Encyclopedia of Information Science and Technology (II), 2005)

Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints. - Imed Kacem; Cherif Sadfi; Abdelkader El Kamel (SMC, 2005)

Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization. - Nozha Zribi; Imed Kacem; Abdelkader El Kamel; Pierre Borne (IEEE Trans. Syst. Man Cybern. Part C, 2007)

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. - Imed Kacem (Comput. Ind. Eng., 2008)

Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. - Imed Kacem; Chengbin Chu; Ahmed Souissi (Comput. Oper. Res., 2008)

Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. - Imed Kacem; Chengbin Chu (Eur. J. Oper. Res., 2008)

Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. - Imed Kacem; Chengbin Chu (Int. J. Comput. Integr. Manuf., 2008)

Approximation algorithms for single machine scheduling with one unavailability period. - Imed Kacem; Mohamed Haouari (4OR, 2009)

An Exact Method for the 2D Guillotine Strip Packing Problem. - Abdelghani Bekrar; Imed Kacem (Adv. Oper. Res., 2009)

Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. - Imed Kacem; Ali Ridha Mahjoub (Comput. Ind. Eng., 2009)

Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. - Racem Mellouli; Cherif Sadfi; Chengbin Chu; Imed Kacem (Eur. J. Oper. Res., 2009)

Scheduling on parallel identical machines to minimise the total weighted tardiness. - Nizar Souayah; Imed Kacem; Mohamed Haouari; Chengbin Chu (Int. J. Adv. Oper. Manag., 2009)

Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. - Imed Kacem (J. Comb. Optim., 2009)

New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. - Imed Kacem (CTW, 2010)

Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. - Imed Kacem (Discret. Appl. Math., 2010)

A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. - Mhand Hifi; Imed Kacem; Stéphane Nègre; Lei Wu 005 (Electron. Notes Discret. Math., 2010)

Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. - Makram Zaidi; Bassem Jarboui; Imed Kacem; Taïcir Loukil (Electron. Notes Discret. Math., 2010)

A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. - Ahmed Mellouli; Faouzi Masmoudi; Imed Kacem; Mohamed Haddar (Int. J. Appl. Metaheuristic Comput., 2010)

Evolutionary Algorithm for Scheduling Production Jobs and Preventive Maintenance Activities. - Maher Rebai; Imed Kacem; Kondo H. Adjallah (Business Process Management Workshops (2), 2011)

Erratum to "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(2009) 1708-1712]. - Imed Kacem (Comput. Ind. Eng., 2011)

Foreword: Combinatorial optimization for industrial engineering. - Imed Kacem; Hans Kellerer (Comput. Ind. Eng., 2011)

Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. - Imed Kacem; Hans Kellerer (J. Sched., 2011)

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. - Rabia Nessah; Imed Kacem (Comput. Oper. Res., 2012)

Guest Editorial: Advanced Combinatorial Optimization and Applications. - Said Ben Messaoud; Imed Kacem (Int. J. Comb. Optim. Probl. Informatics, 2012)

Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. - Maher Rebai; Imed Kacem; Kondo H. Adjallah (J. Intell. Manuf., 2012)

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. - Imed Kacem; Nizar Souayah; Mohamed Haouari (RAIRO Oper. Res., 2012)

Effective algorithms for scheduling problems under non-availability constraints (Invited paper). - Imed Kacem (ICSCS, 2013)

Lower bounds for the makespan minimization in job shops. - Yacine Benziani; Imed Kacem; Pierre Laroche; Anass Nagih (ICNSC, 2013)

Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. - Imed Kacem; Anass Nagih; Maryam Seifaddini (ICNSC, 2013)

Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1‖∑wiCiPm, hj1‖∑wiCi scheduling problem. - Racem Mellouli; Imed Kacem; Cherif Sadfi; Chengbin Chu (Appl. Math. Comput., 2013)

Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. - Imed Kacem; Vangelis Th. Paschos (Discret. Optim., 2013)

Scheduling jobs and maintenance activities on parallel machines. - Maher Rebai; Imed Kacem; Kondo H. Adjallah (Oper. Res., 2013)

Unrelated parallel machines with precedence constraints: application to cloud computing. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin (CloudNet, 2014)

Ranking the solution techniques for reactive scheduling problem in operating room. - Vahid Farrokhi; Imed Kacem; Laszlo Pokoradi (CoDIT, 2014)

An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. - Walid Hfaiedh; Cherif Sadfi; Imed Kacem; Atidel B. Hadj-Alouane (CoDIT, 2014)

Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. - Imed Kacem; Hans Kellerer (Discret. Appl. Math., 2014)

Genetic algorithm based scheduling method for lifespan extension of a wireless sensors network. - Yousif Elhadi Elsideeg Ahmed; Kondo H. Adjallah; Imed Kacem; Sharief F. Babikir (IDAACS, 2015)

A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. - Walid Hfaiedh; Cherif Sadfi; Imed Kacem; Atidel Hadj-Alouane (Appl. Math. Comput., 2015)

Branch-and-bound algorithm for the maximum triangle packing problem. - Youcef Abdelsadek; Francine Herrmann; Imed Kacem; Benoît Otjacques (Comput. Ind. Eng., 2015)

Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. - Imed Kacem; Hans Kellerer; Yann Lanuel (J. Comb. Optim., 2015)

Valid inequalities for unrelated parallel machines scheduling with precedence constraints. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (CoDIT, 2016)

Task allocation for wireless sensor network using logic gate-based evolutionary algorithm. - Ayet Allah Ferjani; Noureddine Liouane; Imed Kacem (CoDIT, 2016)

A learning-based model for predicting information diffusion in social networks: Case of Twitter. - Bao-Thien Hoang; Kamel Chelghoum; Imed Kacem (CoDIT, 2016)

Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. - Pascal Schroeder; Günter Schmidt 002; Imed Kacem (CoDIT, 2016)

Modeling Information Diffusion via Reputation Estimation. - Bao-Thien Hoang; Kamel Chelghoum; Imed Kacem (DEXA (1), 2016)

Visual Interactive Approach for Mining Twitter's Networks. - Youcef Abdelsadek; Kamel Chelghoum; Francine Herrmann; Imed Kacem; Benoît Otjacques (DMBD, 2016)

PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS. - Sana Khalfa; Nizar Rokbani; Achraf Jabeur Telmoudi; Imed Kacem; Lotfi Nabli; Alaoui Mdaghri Zoubida (HIS, 2016)

Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses. - Isabelle Pecci; Benoît Martin; Imed Kacem; Imed Maamria; Sébastien Faye; Nicolas Louveton; Gabriela Gheorghe; Thomas Engel 001 (HSI, 2016)

On the Community Identification in Weighted Time-Varying Networks. - Youcef Abdelsadek; Kamel Chelghoum; Francine Herrmann; Imed Kacem; Benoît Otjacques (ICSIBO, 2016)

Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (ISCO, 2016)

A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. - Ahmed Abdelmoumene Kadri; Imed Kacem; Karim Labadi (Comput. Ind. Eng., 2016)

Triangles as basis to detect communities: an application to Twitter's network. - Youcef Abdelsadek; Kamel Chelghoum; Francine Herrmann; Imed Kacem; Benoît Otjacques (CoRR, 2016)

On the visualization of the detected communities in dynamic networks: A case study of Twitter's network. - Youcef Abdelsadek; Kamel Chelghoum; Francine Herrmann; Imed Kacem; Benoît Otjacques (CoRR, 2016)

Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. - Aristide Grange; Imed Kacem; Sébastien Martin (CoRR, 2016)

Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. - Imed Kacem; Hans Kellerer; Maryam Seifaddini (J. Comb. Optim., 2016)

Foreword - Advanced Optimization Approaches and Modern OR-Applications. - Imed Kacem; Hans Kellerer; Pierre Laroche (RAIRO Oper. Res., 2016)

Semi-online scheduling on a single machine with unexpected breakdown. - Imed Kacem; Hans Kellerer (Theor. Comput. Sci., 2016)

A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. - Fadel Abdallah; Camel Tanougast; Imed Kacem; Camille Diou; Daniel Singer (CoDIT, 2017)

Mathematical formulation for open shop scheduling problem. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (CoDIT, 2017)

Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios". - Imed Kacem; Telmo Reis Cunha; Valerie Botta-Genoulaz (CoDIT, 2017)

Applications of Optimization Methods to Industrial Engineering Problems. - Imed Kacem (Comput. Ind. Eng., 2017)

Approximation Algorithms for the Open Shop Problem with Delivery Times. - Imed Kacem; Christophe Rapine (CoRR, 2017)

Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. - Imed Kacem; Myriam Sahnoune; Günter Schmidt 002 (RAIRO Oper. Res., 2017)

Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoDIT, 2018)

Genetic Algorithm for Open Shop Scheduling Problem. - Yacine Benziani; Imed Kacem; Pierre Laroche (CoDIT, 2018)

Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. - Imed Kacem; Hans Kellerer (ICCL, 2018)

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. - Imed Kacem; Hans Kellerer (Algorithmica, 2018)

NDSC based methods for maximizing the lifespan of randomly deployed wireless sensor networks for infrastructures monitoring. - Yousif Elhadi Elsideeg Ahmed; Kondo H. Adjallah; Romuald Stock; Imed Kacem; Sharief F. Babiker (Comput. Ind. Eng., 2018)

Algorithms for the bin packing problem with overlapping items. - Aristide Grange; Imed Kacem; Sébastien Martin (Comput. Ind. Eng., 2018)

An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (CoRR, 2018)

A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems. - Imed Kacem; Ahmed Abdelmoumene Kadri; Pierre Laroche (Intell. Autom. Soft Comput., 2018)

Industry Applications of Computational Intelligence: Preface. - Runliang Dou; Chen-Fu Chien 001; Imed Kacem; Chia-Yu Hsu 003 (Int. J. Comput. Intell. Syst., 2018)

Community extraction and visualization in social networks applied to Twitter. - Youcef Abdelsadek; Kamel Chelghoum; Francine Herrmann; Imed Kacem; Benoît Otjacques (Inf. Sci., 2018)

On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. - Mohammed-Albarra Hassan Abdel-Jabbar; Imed Kacem; Sébastien Martin; Izzeldin M. Osman (J. Comb. Optim., 2018)

2-Dimensional packing algorithms on a variable-size rectangular interface. - Imed Kacem; Ilyes Kadri; Benoît Martin; Isabelle Pecci (CoDIT, 2019)

New algorithms for online time series search with interrelated prices. - Pascal Schroeder; Imed Kacem (CoDIT, 2019)

Improving Sentiment Analysis in Twitter Using Sentiment Specific Word Embeddings. - Rania Othman; Youcef Abdelsadek; Kamel Chelghoum; Imed Kacem; Rim Faiz (IDAACS, 2019)

Genetic algorithms for scheduling in a CPU/FPGA architecture with heterogeneous communication delays. - Fadel Abdallah; Camel Tanougast; Imed Kacem; Camille Diou; Daniel Singer (Comput. Ind. Eng., 2019)

Optimal cash management with uncertain, interrelated and bounded demands. - Pascal Schroeder; Imed Kacem (Comput. Ind. Eng., 2019)

Complexity results for common due date scheduling problems with interval data and minmax regret criterion. - Imed Kacem; Hans Kellerer (Discret. Appl. Math., 2019)

Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. - Pascal Schroeder; Imed Kacem; Günter Schmidt 002 (RAIRO Oper. Res., 2019)

Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems. - Ahmed Abdelmoumene Kadri; Imed Kacem; Karim Labadi (Soft Comput., 2019)

Scheduling on Hybrid Platforms: Improved Approximability Window. - Vincent Fagnon; Imed Kacem; Giorgio Lucarelli; Bertrand Simon 001 (LATIN, 2020)

Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (Ann. Oper. Res., 2020)

Competitive difference analysis of the cash management problem with uncertain demands. - Pascal Schroeder; Imed Kacem (Eur. J. Oper. Res., 2020)

A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time. - Asma Fekih; Hatem Hadda; Imed Kacem; Atidel B. Hadj-Alouane (DeSE, 2021)

Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model. - Mohamed Naceur Azaiez; Anis Gharbi; Imed Kacem; Yosra Makhlouf; Malek Masmoudi (ICNSC, 2021)

On the Tardiness Minimization on Single Machine. - Bochra Djahel; Imed Kacem; Giorgio Lucarelli (ICNSC, 2021)

Approximate solutions for a special pagination problem with 2 symbols per tile. - Aristide Grange; Imed Kacem; Sébastien Martin; Sarah Minich (ICNSC, 2021)

Algorithms on a variable-size rectangular interface. - Imed Kacem; Ilyes Kadri; Benoît Martin; Isabelle Pecci (ICNSC, 2021)

Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis. - Rania Othman; Rim Faiz; Youcef Abdelsadek; Kamel Chelghoum; Imed Kacem (IDA, 2021)

Preface: New trends on combinatorial optimization for network and logistical applications. - Imed Kacem; Hans Kellerer; Ali Ridha Mahjoub (Ann. Oper. Res., 2021)

Preface: Recent advances in multiple objective optimization and goal programming. - Imed Kacem; Davide La Torre; Hatem Masri (Ann. Oper. Res., 2021)

Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows. - Youcef Abdelsadek; Imed Kacem (Comput. Ind. Eng., 2022)

Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. - Mohamed Naceur Azaiez; Anis Gharbi; Imed Kacem; Yosra Makhlouf; Malek Masmoudi (Comput. Ind. Eng., 2022)

Exact algorithms for scheduling programs with shared tasks. - Imed Kacem; Giorgio Lucarelli; Théo Nazé (J. Comb. Optim., 2022)

Optimal solutions for online conversion problems with interrelated prices. - Pascal Schroeder; Imed Kacem (Oper. Res., 2022)

Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. - Aristide Grange; Imed Kacem; Sébastien Martin; Sarah Minich (RAIRO Oper. Res., 2023)

2-Dimensional packing on a variable size rectangular interface. - Imed Kacem; Ilyes Kadri; Benoît Martin; Isabelle Pecci (Comput. Ind. Eng., 2023)

Intelligent optimization with learning for scheduling and logistics systems. - Mitsuo Gen; Ling Wang 001; Gursel Suer; Imed Kacem; Shi Cheng (Comput. Ind. Eng., 2024)

Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. - Gais Alhadi; Imed Kacem; Pierre Laroche; Izzeldin M. Osman (RAIRO Oper. Res., 2024)

Minimizing the maximum lateness for scheduling with release times and job rejection. - Imed Kacem; Hans Kellerer (J. Comb. Optim., 2024)

Min-max relative regret for scheduling to minimize maximum lateness. - Imad Assayakh; Imed Kacem; Giorgio Lucarelli (Ann. Oper. Res., 2025)

New trends of combinatorial optimization and applications. - Imed Kacem; Safa Bhar Layeb; Nelson Maculan; Ali Ridha Mahjoub (Ann. Oper. Res., 2025)