Imed Kacem

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