Imed Kacem

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 63

Top Venues

Publications

Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. RAIRO Oper. Res. 58 (3) (2024)
Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. RAIRO Oper. Res. 57 (1) (2023)
Imad Assayakh, Imed Kacem, Giorgio Lucarelli
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. IWOCA (2023)
Imed Kacem, Ilyes Kadri, Benoît Martin, Isabelle Pecci
2-Dimensional packing on a variable size rectangular interface. Comput. Ind. Eng. 177 (2023)
Mohamed Naceur Azaiez, Anis Gharbi, Imed Kacem, Yosra Makhlouf, Malek Masmoudi
Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. Comput. Ind. Eng. 168 (2022)
Imed Kacem, Giorgio Lucarelli, Théo Nazé
Exact algorithms for scheduling programs with shared tasks. J. Comb. Optim. 43 (5) (2022)
Pascal Schroeder, Imed Kacem
Optimal solutions for online conversion problems with interrelated prices. Oper. Res. 22 (1) (2022)
Youcef Abdelsadek, Imed Kacem
Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows. Comput. Ind. Eng. 165 (2022)
Imed Kacem, Hans Kellerer, Ali Ridha Mahjoub
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298 (1) (2021)
Imed Kacem, Davide La Torre, Hatem Masri
Preface: Recent advances in multiple objective optimization and goal programming. Ann. Oper. Res. 296 (1) (2021)
Asma Fekih, Hatem Hadda, Imed Kacem, Atidel B. Hadj-Alouane
A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time. DeSE (2021)
Imed Kacem, Ilyes Kadri, Benoît Martin, Isabelle Pecci
Algorithms on a variable-size rectangular interface. ICNSC (2021)
Aristide Grange, Imed Kacem, Sébastien Martin, Sarah Minich
Approximate solutions for a special pagination problem with 2 symbols per tile. ICNSC (2021)
Rania Othman, Rim Faiz, Youcef Abdelsadek, Kamel Chelghoum, Imed Kacem
Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis. IDA (2021)
Bochra Djahel, Imed Kacem, Giorgio Lucarelli
On the Tardiness Minimization on Single Machine. ICNSC (2021)
Mohamed Naceur Azaiez, Anis Gharbi, Imed Kacem, Yosra Makhlouf, Malek Masmoudi
Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model. ICNSC (2021)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Ann. Oper. Res. 285 (1) (2020)
Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon
Scheduling on Hybrid Platforms: Improved Approximability Window. LATIN (2020)
Pascal Schroeder, Imed Kacem
Competitive difference analysis of the cash management problem with uncertain demands. Eur. J. Oper. Res. 283 (3) (2020)
Imed Kacem, Giorgio Lucarelli, Théo Nazé
Exact Algorithms for Scheduling Programs with Shared Tasks. WorldCIST (2) (2020)
Rania Othman, Youcef Abdelsadek, Kamel Chelghoum, Imed Kacem, Rim Faiz
Improving Sentiment Analysis in Twitter Using Sentiment Specific Word Embeddings. IDAACS (2019)
Imed Kacem, Hans Kellerer
Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discret. Appl. Math. 264 (2019)
Fadel Abdallah, Camel Tanougast, Imed Kacem, Camille Diou, Daniel Singer
Genetic algorithms for scheduling in a CPU/FPGA architecture with heterogeneous communication delays. Comput. Ind. Eng. 137 (2019)
Pascal Schroeder, Imed Kacem
New algorithms for online time series search with interrelated prices. CoDIT (2019)
Imed Kacem, Ilyes Kadri, Benoît Martin, Isabelle Pecci
2-Dimensional packing algorithms on a variable-size rectangular interface. CoDIT (2019)
Ahmed Abdelmoumene Kadri, Imed Kacem, Karim Labadi
Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems. Soft Comput. 23 (14) (2019)
Pascal Schroeder, Imed Kacem
Optimal cash management with uncertain, interrelated and bounded demands. Comput. Ind. Eng. 133 (2019)
Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon
Scheduling on Hybrid Platforms: Improved Approximability Window. CoRR (2019)
Pascal Schroeder, Imed Kacem, Günter Schmidt
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. RAIRO Oper. Res. 53 (2) (2019)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. CoDIT (2018)
Yacine Benziani, Imed Kacem, Pierre Laroche
Genetic Algorithm for Open Shop Scheduling Problem. CoDIT (2018)
Imed Kacem, Hans Kellerer
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Algorithmica 80 (12) (2018)
Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. CoRR (2018)
Aristide Grange, Imed Kacem, Sébastien Martin
Algorithms for the bin packing problem with overlapping items. Comput. Ind. Eng. 115 (2018)
Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. J. Comb. Optim. 36 (3) (2018)
Imed Kacem, Hans Kellerer
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ICCL (2018)
Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah, Romuald Stock, Imed Kacem, Sharief F. Babiker
NDSC based methods for maximizing the lifespan of randomly deployed wireless sensor networks for infrastructures monitoring. Comput. Ind. Eng. 115 (2018)
Runliang Dou, Chen-Fu Chien, Imed Kacem, Chia-Yu Hsu
Industry Applications of Computational Intelligence: Preface. Int. J. Comput. Intell. Syst. 11 (1) (2018)
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques
Community extraction and visualization in social networks applied to Twitter. Inf. Sci. 424 (2018)
Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman
Mathematical formulation for open shop scheduling problem. CoDIT (2017)
Imed Kacem
Applications of Optimization Methods to Industrial Engineering Problems. Comput. Ind. Eng. 112 (2017)
Imed Kacem, Hans Kellerer
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints. CoRR (2017)
Fadel Abdallah, Camel Tanougast, Imed Kacem, Camille Diou, Daniel Singer
A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. CoDIT (2017)
Imed Kacem, Christophe Rapine
Approximation Algorithms for the Open Shop Problem with Delivery Times. CoRR (2017)
Imed Kacem, Myriam Sahnoune, Günter Schmidt
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO Oper. Res. 51 (4) (2017)
Imed Kacem, Telmo Reis Cunha, Valerie Botta-Genoulaz
Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios". CoDIT (2017)
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques
Triangles as basis to detect communities: an application to Twitter's network. CoRR (2016)
Pascal Schroeder, Günter Schmidt, Imed Kacem
Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. CoDIT (2016)
Sana Khalfa, Nizar Rokbani, Achraf Jabeur Telmoudi, Imed Kacem, Lotfi Nabli, Alaoui Mdaghri Zoubida
PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS. HIS (2016)
Bao-Thien Hoang, Kamel Chelghoum, Imed Kacem
Modeling Information Diffusion via Reputation Estimation. DEXA (1) (2016)
Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. ISCO (2016)
Imed Kacem, Hans Kellerer, Pierre Laroche
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50 (4-5) (2016)
Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman
Valid inequalities for unrelated parallel machines scheduling with precedence constraints. CoDIT (2016)
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques
On the visualization of the detected communities in dynamic networks: A case study of Twitter's network. CoRR (2016)
Imed Kacem, Hans Kellerer, Maryam Seifaddini
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim. 32 (3) (2016)
Imed Kacem, Hans Kellerer
Semi-online scheduling on a single machine with unexpected breakdown. Theor. Comput. Sci. 646 (2016)
Isabelle Pecci, Benoît Martin, Imed Kacem, Imed Maamria, Sébastien Faye, Nicolas Louveton, Gabriela Gheorghe, Thomas Engel
Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses. HSI (2016)
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques
Visual Interactive Approach for Mining Twitter's Networks. DMBD (2016)
Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques
On the Community Identification in Weighted Time-Varying Networks. ICSIBO (2016)
Ahmed Abdelmoumene Kadri, Imed Kacem, Karim Labadi
A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. Comput. Ind. Eng. 95 (2016)
Ayet Allah Ferjani, Noureddine Liouane, Imed Kacem
Task allocation for wireless sensor network using logic gate-based evolutionary algorithm. CoDIT (2016)
Bao-Thien Hoang, Kamel Chelghoum, Imed Kacem
A learning-based model for predicting information diffusion in social networks: Case of Twitter. CoDIT (2016)
Aristide Grange, Imed Kacem, Sébastien Martin
Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. CoRR (2016)
Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel Hadj-Alouane
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 (2015)
Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah, Imed Kacem, Sharief F. Babikir
Genetic algorithm based scheduling method for lifespan extension of a wireless sensors network. IDAACS (2015)
Imed Kacem, Hans Kellerer, Yann Lanuel
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J. Comb. Optim. 30 (3) (2015)
Youcef Abdelsadek, Francine Herrmann, Imed Kacem, Benoît Otjacques
Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Ind. Eng. 81 (2015)
Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel B. Hadj-Alouane
An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. CoDIT (2014)
Imed Kacem, Hans Kellerer
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 164 (2014)
Vahid Farrokhi, Imed Kacem, Laszlo Pokoradi
Ranking the solution techniques for reactive scheduling problem in operating room. CoDIT (2014)
Imed Kacem, Hans Kellerer, Maryam Seifaddini
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ISCO (2014)
Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin
Unrelated parallel machines with precedence constraints: application to cloud computing. CloudNet (2014)
Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih
Lower bounds for the makespan minimization in job shops. ICNSC (2013)
Imed Kacem
Effective algorithms for scheduling problems under non-availability constraints (Invited paper). ICSCS (2013)
Maher Rebai, Imed Kacem, Kondo H. Adjallah
Scheduling jobs and maintenance activities on parallel machines. Oper. Res. 13 (3) (2013)
Racem Mellouli, Imed Kacem, Cherif Sadfi, Chengbin Chu
Pm, hj1‖∑wiCi scheduling problem. Appl. Math. Comput. 219 (22) (2013)
Imed Kacem, Anass Nagih, Maryam Seifaddini
Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. ICNSC (2013)
Imed Kacem, Vangelis Th. Paschos
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discret. Optim. 10 (1) (2013)
Rabia Nessah, Imed Kacem
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res. 39 (3) (2012)
Said Ben Messaoud, Imed Kacem
Guest Editorial: Advanced Combinatorial Optimization and Applications. Int. J. Comb. Optim. Probl. Informatics 3 (3) (2012)
Maher Rebai, Imed Kacem, Kondo H. Adjallah
Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. J. Intell. Manuf. 23 (4) (2012)
Imed Kacem, Nizar Souayah, Mohamed Haouari
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO Oper. Res. 46 (2) (2012)
Imed Kacem, Hans Kellerer
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 (3) (2011)
Imed Kacem, Hans Kellerer
Foreword: Combinatorial optimization for industrial engineering. Comput. Ind. Eng. 61 (2) (2011)
Maher Rebai, Imed Kacem, Kondo H. Adjallah
Evolutionary Algorithm for Scheduling Production Jobs and Preventive Maintenance Activities. Business Process Management Workshops (2) (2011)
Imed Kacem
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]. Comput. Ind. Eng. 61 (4) (2011)
Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electron. Notes Discret. Math. 36 (2010)
Imed Kacem
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. CTW (2010)
Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electron. Notes Discret. Math. 36 (2010)
Imed Kacem
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discret. Appl. Math. 158 (9) (2010)
Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem, Mohamed Haddar
A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. Int. J. Appl. Metaheuristic Comput. 1 (2) (2010)
Nizar Souayah, Imed Kacem, Mohamed Haouari, Chengbin Chu
Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manag. 1 (1) (2009)
Imed Kacem, Ali Ridha Mahjoub
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 (4) (2009)
Imed Kacem
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. J. Comb. Optim. 17 (2) (2009)
Abdelghani Bekrar, Imed Kacem
An Exact Method for the 2D Guillotine Strip Packing Problem. Adv. Oper. Res. 2009 (2009)
Imed Kacem, Mohamed Haouari
Approximation algorithms for single machine scheduling with one unavailability period. 4OR 7 (1) (2009)
Racem Mellouli, Cherif Sadfi, Chengbin Chu, Imed Kacem
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Eur. J. Oper. Res. 197 (3) (2009)
Imed Kacem, Chengbin Chu
Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Int. J. Comput. Integr. Manuf. 21 (4) (2008)
Imed Kacem, Chengbin Chu, Ahmed Souissi
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Comput. Oper. Res. 35 (3) (2008)
Imed Kacem
Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng. 54 (3) (2008)

Imed Kacem.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Imed Kacem