Accueil › Annuaire des chercheurs › Imed Kacem

Imed Kacem

Affiliation : Laboratoire de Conception, Optimisation et Modélisation des Systèmes · Université de Lorraine

• 27Publications (affiliation française)
• 220Publications au total
• 3161Citations
• 22Indice h

ORCIDOpenAlex

Domaines de recherche

• Scheduling and Optimization Algorithms
• Resource-Constrained Project Scheduling
• Complexity and Algorithms in Graphs
• Healthcare Operations and Scheduling Optimization
• Advanced Manufacturing and Logistics Optimization

Publications (27)

• Machine Learning for Characterizing the Tardiness Minimization Problem on a Single Machine
  2026 · Lecture notes in networks and systems
• Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval
  2026 · Lecture notes in networks and systems
• New trends of combinatorial optimization and applications
  2025 · Annals of Operations Research
• Effective Meta-heuristics for a Flow-Shop Scheduling Problem with Interstage Transportation Times
  2025 · Journal of the Operations Research Society of China
• Mixed-Integer Programming and Constraint Programming Models for the Flexible Job Shop Scheduling Problem
  2023 · Lecture notes in networks and systems · cité 3 fois
• Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling
  2022 · Computers & Industrial Engineering · cité 24 fois
• Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model
  2021 · IEEE International Conference on Networking, Sensing and Control (ICNSC) · cité 4 fois
• A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time
  2021 · International Conference on Developments in eSystems Engineering (DeSE) · cité 3 fois
• On the Tardiness Minimization on Single Machine
  2021 · IEEE International Conference on Networking, Sensing and Control (ICNSC) · cité 1 fois
• Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis
  2021 · Lecture notes in computer science · cité 1 fois
• A hybrid genetic Tabu search algorithm for minimising total completion time in a flexible job-shop scheduling problem
  2020 · European J of Industrial Engineering · cité 19 fois
• Improving Sentiment Analysis in Twitter Using Sentiment Specific Word Embeddings
  2019 · IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS) · cité 17 fois
• CoDIT'18 Committees
  2018 · International Conference on Control, Decision and Information Technologies (CoDIT)
• PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS
  2017 · Advances in intelligent systems and computing · cité 1 fois
• Task allocation for wireless sensor network using logic gate-based evolutionary algorithm
  2016 · International Conference on Control, Decision and Information Technologies (CoDIT) · cité 8 fois
• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
  2015 · Applied Mathematics and Computation · cité 13 fois
• Genetic algorithm for scheduling surgical units
  2015 · HAL
• An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
  2014 · International Conference on Control, Decision and Information Technologies (CoDIT)
• Lagrangian relaxation and column generation-based lower bounds for the Pm,hj1‖∑wiCi scheduling problem
  2013 · Applied Mathematics and Computation · cité 5 fois
• Lower bounds and an enhanced greedy heuristic for the single processor scheduling with release dates
  2013 · International Conference on Control, Decision and Information Technologies (CoDIT)
• Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
  2012 · RAIRO - Operations Research · cité 3 fois
• A Hybrid Genetic Algorithm for Optimization of Two-Dimensional Cutting-Stock Problem
  2012 · IGI Global eBooks
• No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates
  2011 · International Journal of Production Research · cité 32 fois
• Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
  2010 · Electronic Notes in Discrete Mathematics · cité 5 fois
• A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem
  2010 · International Journal of Applied Metaheuristic Computing · cité 1 fois
• Scheduling on parallel identical machines to minimise the total weighted tardiness
  2009 · International Journal of Advanced Operations Management · cité 6 fois
• Minimiser le makespan avec prise en compte d'indisponibilité sur une seule machine
  2006 · HAL

Revues de publication

• International Conference on Control, Decision and Information Technologies (CoDIT) × 4
• Lecture notes in networks and systems × 3
• IEEE International Conference on Networking, Sensing and Control (ICNSC) × 2
• Applied Mathematics and Computation × 2
• HAL × 2
• Annals of Operations Research × 1

Publications par année

• 20262
• 20252
• 20231
• 20221
• 20214
• 20201
• 20191
• 20181
• 20171
• 20161

Collaborations

Établissements partenaires : École Centrale Paris · University Mohamed Boudiaf of M'sila · Centre National de la Recherche Scientifique · Université de Technologie de Troyes · Institut national de recherche en sciences et technologies du numérique

Pays des co-auteurs : Algérie · Maroc

Co-auteurs

• Youcef Abdelsadek
• Chengbin Chu
• Giorgio Lucarelli
• Bochra Djahel
• Yosra Makhlouf
• Kamel Chelghoum
• Noureddine Tlati
• Ali Ridha Mahjoub
• Malek Masmoudi A
• Nidhal Rezg
• Chérif Sadfi
• Myriam Sahnoune

Données bibliographiques issues d’OpenAlex (base ouverte).