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.
The distributed permutation flowshop scheduling problem
This map shows the geographic impact of Bahman Naderi'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 Bahman Naderi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bahman Naderi more than expected).
This network shows the impact of papers produced by Bahman Naderi. 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 Bahman Naderi. The network helps show where Bahman Naderi may publish in the future.
Co-authorship network of co-authors of Bahman Naderi
This figure shows the co-authorship network connecting the top 25 collaborators of Bahman Naderi.
A scholar is included among the top collaborators of Bahman Naderi 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 Bahman Naderi. Bahman Naderi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Fazli-Khalaf, Mohamadreza, Bahman Naderi, & Mohammad Mohammadi. (2018). Design of a reliable supply chain network with responsiveness considerations under uncertainty: case study of an Iranian tire manufacturer. Journal of industrial and systems engineering.. 11. 120–131.5 indexed citations
Mohammadi, Mohammad, et al.. (2017). Multi objective organ transplant supply chain with effective location and time consideration. Journal of industrial and systems engineering.. 10(4). 158–176.1 indexed citations
Naderi, Bahman & Mehdi Yazdani. (2015). Modelling and Scheduling Lot Streaming Flexible Flow Lines. SHILAP Revista de lepidopterología.1 indexed citations
Naderi, Bahman. (2013). The project portfolio selection and scheduling problem: mathematical model and algorithms. SHILAP Revista de lepidopterología.11 indexed citations
16.
Naderi, Bahman, et al.. (2012). A Multi-objective Simulated Annealing Algorithm for Solving the Flexible no-wait Flowshop Scheduling Problem with Transportation Times. 6(211). 33–41.4 indexed citations
17.
Najafi, Esmaeil, et al.. (2012). A Mathematical Model and a Solution Method for Hybrid Flow Shop Scheduling. SHILAP Revista de lepidopterología. 5(10). 65–72.2 indexed citations
18.
Khalili, Majid, Mohammad Jafar Tarokh, & Bahman Naderi. (2010). Using Electromagnetism Algorithm for Determining the Number of kanbans in a Multi-stage Supply Chain System. SHILAP Revista de lepidopterología.3 indexed citations
19.
Jolai, Fariborz, M. Zandieh, & Bahman Naderi. (2010). A Memetic Algorithm for Hybrid Flowshops with Flexible MachineAvailability Constraints. SHILAP Revista de lepidopterología.1 indexed citations
20.
Naderi, Bahman, et al.. (2009). AN ITERATED GREEDY ALGORITHM FOR FLEXIBLE FLOW LINES WITH SEQUENCE DEPENDENT SETUP TIMES TO MINIMIZE TOTAL WEIGHTED COMPLETION TIME. SHILAP Revista de lepidopterología. 3(3). 33–37.4 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.