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
2002563 citationsImed Kacem, Slim Hammadi et al.profile →
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic
2002433 citationsImed Kacem, Slim Hammadi et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Pierre Borne'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 Pierre Borne with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pierre Borne more than expected).
This network shows the impact of papers produced by Pierre Borne. 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 Pierre Borne. The network helps show where Pierre Borne may publish in the future.
Co-authorship network of co-authors of Pierre Borne
This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Borne.
A scholar is included among the top collaborators of Pierre Borne 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 Pierre Borne. Pierre Borne is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zadeh, Lotfi A., et al.. (2005). Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems. International Conference on Software Engineering.2 indexed citations
7.
Borne, Pierre, et al.. (2005). Commande LQG multimodèle d’une turbine éolienne à vitesse variable. 2005(4).1 indexed citations
8.
Kacem, Imed, et al.. (2004). Optimization by phases for the flexible job-shop scheduling problem. Asian Control Conference. 3. 1889–1895.10 indexed citations
9.
Mesghouni, Khaled, Slim Hammadi, & Pierre Borne. (2004). EVOLUTIONARY ALGORITHMS FOR JOB-SHOP SCHEDULING. International Journal of Applied Mathematics and Computer Science. 14(1). 91–103.44 indexed citations
10.
Kamel, Abdelkader El, Khaled Mellouli, Pierre Borne, & Man Ieee Systems. (2002). 2002 IEEE International Conference on Systems, Man, and Cybernetics : bridging the digital divide : cyber-development, human progress, peace and prosperity : Yasmine Hammamet, Tunisia, October 6-9, 2002 : conference proceedings.6 indexed citations
11.
Hammadi, Slim, et al.. (2000). THE CONTRIBUTION OF LINEAR PROGRAMMING BY CONSTRAINTS PROPAGATION IN THE REGULATION OF TRAFFIC OF URBAN TRANSPORT NETWORK.4 indexed citations
Perruquetti, Wilfrid, Jean‐Pierre Richard, & Pierre Borne. (1993). Estimation of non linear time varying behaviours using vector norms. Systems Analysis Modelling Simulation. 11(3). 167–184.1 indexed citations
17.
Borne, Pierre, et al.. (1990). Estimation of attractive domains for locally stable or unstable systems. Systems Analysis Modelling Simulation. 7(8). 595–610.4 indexed citations
18.
Borne, Pierre, et al.. (1987). Applied modelling and simulation of technological systems : proceedings of the 1st IMACS Symposium on Modelling and Simulation for Control of Lumped and Distributed Parameter Systems, Lille, France, 3-6 June, 1986. North-Holland eBooks.
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.