Imed Kacem

3.0k total citations · 2 hit papers
102 papers, 2.1k citations indexed

About

Imed Kacem is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Imed Kacem has authored 102 papers receiving a total of 2.1k indexed citations (citations by other indexed papers that have themselves been cited), including 84 papers in Industrial and Manufacturing Engineering, 46 papers in Computer Networks and Communications and 14 papers in Artificial Intelligence. Recurrent topics in Imed Kacem's work include Scheduling and Optimization Algorithms (66 papers), Advanced Manufacturing and Logistics Optimization (43 papers) and Optimization and Search Problems (42 papers). Imed Kacem is often cited by papers focused on Scheduling and Optimization Algorithms (66 papers), Advanced Manufacturing and Logistics Optimization (43 papers) and Optimization and Search Problems (42 papers). Imed Kacem collaborates with scholars based in France, Tunisia and Austria. Imed Kacem's co-authors include Pierre Borne, Slim Hammadi, Chengbin Chu, Karim Labadi, Hans Kellerer, Kondo H. Adjallah, A. Ridha Mahjoub, Sébastien Martin, Abdelghani Bekrar and Abdelkader El Kamel and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and International Journal of Production Economics.

In The Last Decade

Imed Kacem

95 papers receiving 2.0k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems

2002 563 citations Imed Kacem, Pierre Borne et al. profile →
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic

2002 433 citations Imed Kacem, Pierre Borne et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Imed Kacem France	19	1.8k	541	418	239	92	102	2.1k
Slim Hammadi France	16	1.3k 0.7×	262 0.5×	468 1.1×	310 1.3×	101 1.1×	95	1.7k
Saïd Hanafi France	23	1.1k 0.6×	363 0.7×	236 0.6×	88 0.4×	94 1.0×	90	1.5k
Dragan Urošević Serbia	25	1.1k 0.6×	228 0.4×	367 0.9×	143 0.6×	153 1.7×	86	1.6k
Monaldo Mastrolilli Switzerland	16	962 0.5×	388 0.7×	218 0.5×	107 0.4×	127 1.4×	48	1.2k
Vincent t'Kindt France	17	760 0.4×	305 0.6×	172 0.4×	121 0.5×	165 1.8×	58	1.1k
Paola Festa Italy	19	685 0.4×	280 0.5×	309 0.7×	79 0.3×	162 1.8×	68	1.4k
Saoussen Krichen Tunisia	19	431 0.2×	544 1.0×	452 1.1×	74 0.3×	69 0.8×	115	1.4k
Ferdinando Pezzella Italy	16	1.4k 0.8×	250 0.5×	286 0.7×	135 0.6×	60 0.7×	20	1.6k
Artur Alves Pessoa Brazil	23	1.3k 0.7×	198 0.4×	222 0.5×	112 0.5×	91 1.0×	68	1.6k
Geraldo Robson Mateus Brazil	22	1.0k 0.6×	523 1.0×	167 0.4×	92 0.4×	106 1.2×	119	1.7k

Countries citing papers authored by Imed Kacem

Since Specialization

Citations

This map shows the geographic impact of Imed Kacem's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Imed Kacem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Imed Kacem more than expected).

Fields of papers citing papers by Imed Kacem

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Imed Kacem. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Imed Kacem. The network helps show where Imed Kacem may publish in the future.

Co-authorship network of co-authors of Imed Kacem

This figure shows the co-authorship network connecting the top 25 collaborators of Imed Kacem. A scholar is included among the top collaborators of Imed Kacem based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Imed Kacem. Imed Kacem is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Kacem, Imed, et al.. (2024). Min–max relative regret for scheduling to minimize maximum lateness. Annals of Operations Research. 351(1). 751–778.

Kacem, Imed, et al.. (2023). 2-Dimensional packing on a variable size rectangular interface. Computers & Industrial Engineering. 177. 109022–109022.

Kacem, Imed, et al.. (2021). Exact algorithms for scheduling programs with shared tasks. Journal of Combinatorial Optimization. 43(5). 1602–1627. 1 indexed citations

Azaiez, Mohamed Naceur, et al.. (2021). Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model. 1–5.

Kacem, Imed, et al.. (2020). Optimal solutions for online conversion problems with interrelated prices. Operational Research. 22(1). 423–448. 2 indexed citations

Kacem, Imed & Hans Kellerer. (2018). Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discrete Applied Mathematics. 264. 76–89. 7 indexed citations

Kacem, Imed & Hans Kellerer. (2017). Approximation Schemes for Minimizing the Maximum Lateness on a Single\n Machine with Release Times under Non-Availability or Deadline Constraints. arXiv (Cornell University). 9 indexed citations

Kacem, Imed, et al.. (2017). Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO - Operations Research. 51(4). 1177–1188. 5 indexed citations

Kacem, Imed & Hans Kellerer. (2016). Semi-online scheduling on a single machine with unexpected breakdown. Theoretical Computer Science. 646. 40–48. 8 indexed citations

10.

Kacem, Imed, et al.. (2015). On the Knapsack Problem under Merging Objects' Constraints. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

11.

Tanougast, Camel, et al.. (2015). Genetic algorithm approaches for scheduling in a cpu/FPGA architecture with hererogeneous communication delays. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

12.

Levner, Eugene & Imed Kacem. (2015). An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs. Journal of Industrial and Management Optimization. 12(3). 811–817. 10 indexed citations

13.

Kacem, Imed, et al.. (2013). Towards an Efficient Handling of the Maximum Triangle Packing Problem. HAL (Le Centre pour la Communication Scientifique Directe).

14.

Kacem, Imed, et al.. (2012). Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discrete Optimization. 10(1). 61–68. 6 indexed citations

15.

Kacem, Imed & Hans Kellerer. (2011). Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discrete Applied Mathematics. 164. 154–160. 17 indexed citations

16.

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

17.

Kacem, Imed. (2010). Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discrete Applied Mathematics. 158(9). 1035–1040. 22 indexed citations

18.

Bekrar, Abdelghani, Imed Kacem, & Chengbin Chu. (2007). A COMPARATIVE STUDY OF EXACT ALGORITHMS FOR THE TWO DIMENSIONAL STRIP PACKING PROBLEM. Journal of industrial and systems engineering.. 1(2). 151–170. 8 indexed citations

19.

Dridi, Mahjoub & Imed Kacem. (2004). A HYBRID APPROACH FOR SCHEDULING TRANSPORTATION NETWORKS. International Journal of Applied Mathematics and Computer Science. 14(3). 397–409. 9 indexed citations

20.

Kacem, Imed, et al.. (2004). Optimization by phases for the flexible job-shop scheduling problem. Asian Control Conference. 3. 1889–1895. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact