Home › Researcher directory › Imen Hamdi
Imen Hamdi
Affiliation : University of Sfax · Faculty of Sciences of Sfax
- 16Publications (affiliation in Tunisia)
- 21Total publications
- 100Citations
- 6h-index
Research profile
Imen Hamdi has 16 indexed publications (2011–2025). Their work appears mainly in “International Journal of Operational Research”, “International Conference on Control, Decision and Information Technologies (CoDIT)” and “Tunisian Scientific and Technical Information Portal”. Their most cited article, “Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags” (2014), has been cited 18 times. 3 of these publications date from the last three years of activity. Their work is co-authored with at least 5 researchers, including institutions in Saudi Arabia.
Is this you? Get your research seen
Create your free DzCademia profile and add your articles: they will show up more easily on Google and in AI assistants like ChatGPT, so more people can read and cite your work.
Create my free profile Add my publicationsResearch areas
- Scheduling and Optimization Algorithms
- Healthcare Operations and Scheduling Optimization
- Resource-Constrained Project Scheduling
- Advanced Manufacturing and Logistics Optimization
- Vehicle Routing Optimization Methods
Publications (16)
- Synthèse, caractérisation, simulation théorique et étude des propriétés électriques et optiques de matériaux spinelles à base de chrome et d’holmium pour applications multifonctionnelles
- Solving the cumulative capacitated vehicle routing problem with drones
- An ISM-MICMAC approach for analyzing the relationship between blockchain adoption criteria in a pharmaceutical supply chain: Tunisian case
- Particle swarm optimization based-algorithms to solve the two-machine cross-docking flow shop problem: just in time scheduling
- Exact and heuristic methods to solve the two-machine cross-docking flow shop scheduling problem
- MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
- A Genetic Algorithm to Minimize the Makespan in a Two-Machine Cross-Docking Flow Shop Problem
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
- Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags
- Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
- Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags
- Logic-based Benders decomposition to solve the permutation flowshop scheduling problem with time lags
- Permutation flowshop problem with time lags scheduling by logic-based Benders decomposition
- Minimizing the makespan in the permutation flowshop problem with minimal and maximal time lags
Publication venues
- International Journal of Operational Research × 4
- International Conference on Control, Decision and Information Technologies (CoDIT) × 2
- Tunisian Scientific and Technical Information Portal × 1
- Journal of Industrial and Production Engineering × 1
- Journal of Modelling in Management × 1
- Journal of Combinatorial Optimization × 1
Publications per year
- 20251
- 20242
- 20221
- 20211
- 20192
- 20162
- 20151
- 20143
- 20132
- 20111
Collaborations
Partner institutions : Faculty of Economics and Management of Sfax · University of Sousse · Majmaah University
Co-authors’ countries : Saudi Arabia
Co-authors
Bibliographic data from OpenAlex (open database).
Why choose DzCademia?
Profiles, articles and conference contributions: give your research a structured public presence. Integrated metadata help search engines and AI assistants identify your work and understand its references.
Comment with Google
Sign in with Google to comment directly on this page.