Nasser Salmasi

817 total citations
33 papers, 701 citations indexed

About

Nasser Salmasi is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Nasser Salmasi has authored 33 papers receiving a total of 701 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Industrial and Manufacturing Engineering, 8 papers in Computer Networks and Communications and 4 papers in Management Information Systems. Recurrent topics in Nasser Salmasi's work include Scheduling and Optimization Algorithms (29 papers), Advanced Manufacturing and Logistics Optimization (22 papers) and Assembly Line Balancing Optimization (16 papers). Nasser Salmasi is often cited by papers focused on Scheduling and Optimization Algorithms (29 papers), Advanced Manufacturing and Logistics Optimization (22 papers) and Assembly Line Balancing Optimization (16 papers). Nasser Salmasi collaborates with scholars based in Iran, United States and Canada. Nasser Salmasi's co-authors include Rasaratnam Logendran, M. Reza Skandari, Bahman Naderi, Omid Shahvari, Chelliah Sriskandarajah, Hamed Jafari, Reza Mokhtari, Babak Abbasi, Martin Savelsbergh and S. Afshin Mansouri and has published in prestigious journals such as International Journal of Production Economics, International Journal of Production Research and Computers & Operations Research.

In The Last Decade

Nasser Salmasi

33 papers receiving 688 citations

Peers

Nasser Salmasi

IME

CNC

CSE

MIS

Michel Gourgand France

Paz Pérez-González Spain

Inés González-Rodríguez Spain

Yang-Kuei Lin Taiwan

Jorge Puente Spain

Natalia V. Shakhlevich United Kingdom

Michael Pinedo United States

Mehdi Abedi Iran

Xueqi Wu China

Milton L. Smith United States

Michel Gourgand France

Nasser Salmasi

450 ×0.7

IME

58 ×0.7

CNC

45 ×0.8

CSE

37 ×0.6

55 ×1.1

MIS

Citations per year, relative to Nasser Salmasi Nasser Salmasi (= 1×) peers Michel Gourgand

Countries citing papers authored by Nasser Salmasi

Since Specialization

Citations

This map shows the geographic impact of Nasser Salmasi'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 Nasser Salmasi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nasser Salmasi more than expected).

Fields of papers citing papers by Nasser Salmasi

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Nasser Salmasi. 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 Nasser Salmasi. The network helps show where Nasser Salmasi may publish in the future.

Co-authorship network of co-authors of Nasser Salmasi

This figure shows the co-authorship network connecting the top 25 collaborators of Nasser Salmasi. A scholar is included among the top collaborators of Nasser Salmasi 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 Nasser Salmasi. Nasser Salmasi 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

Akhavan‐Tabatabaei, Raha, et al.. (2018). Classification and properties of acyclic discrete phase-type distributions based on geometric and shifted geometric distributions. Journal of industrial engineering international. 15(4). 651–665. 3 indexed citations

Salmasi, Nasser, et al.. (2017). Makespan minimization in flowshop batch processing problem with different batch compositions on machines. International Journal of Production Economics. 193. 832–844. 20 indexed citations

Salmasi, Nasser, et al.. (2017). Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times. European J of Industrial Engineering. 11(1). 22–22. 22 indexed citations

Shahvari, Omid, Nasser Salmasi, & Rasaratnam Logendran. (2016). A Meta-Heuristic Algorithm for Flexible Flow Shop Sequence Dependent Group Scheduling Problem. 5 indexed citations

Savelsbergh, Martin, et al.. (2015). A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties. Applied Mathematical Modelling. 39(20). 6410–6424. 27 indexed citations

Jafari, Hamed & Nasser Salmasi. (2015). Maximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm. Journal of industrial engineering international. 11(3). 439–458. 30 indexed citations

Salmasi, Nasser, et al.. (2014). Parallel machine scheduling problem with preemptive jobs and transportation delay. Computers & Operations Research. 50. 14–23. 9 indexed citations

Salmasi, Nasser, et al.. (2014). Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. Annals of Operations Research. 226(1). 351–377. 26 indexed citations

Salmasi, Nasser, et al.. (2013). Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem. International Journal of Production Research. 51(20). 6182–6193. 21 indexed citations

10.

Salmasi, Nasser, et al.. (2012). Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming. Mathematical and Computer Modelling. 57(5-6). 1154–1164. 20 indexed citations

11.

Salmasi, Nasser, et al.. (2012). A two-criteria objective function flexible flowshop scheduling problem with machine eligibility constraint. The International Journal of Advanced Manufacturing Technology. 64(5-8). 1001–1015. 12 indexed citations

12.

Naderi, Bahman & Nasser Salmasi. (2012). Permutation flowshops in group scheduling with sequence-dependent setup times. European J of Industrial Engineering. 6(2). 177–177. 44 indexed citations

13.

Salmasi, Nasser, et al.. (2012). Stochastic flow-shop scheduling with minimizing the expected number of tardy jobs. The International Journal of Advanced Manufacturing Technology. 66(1-4). 337–346. 16 indexed citations

14.

Salmasi, Nasser, et al.. (2012). A Flexible Flowshop Scheduling Problem With Machine Eligibility Constraint And Two Criteria Objective Function. Zenodo (CERN European Organization for Nuclear Research). 6(2). 388–393. 4 indexed citations

15.

Salmasi, Nasser, et al.. (2012). Due date assignment in single machine with stochastic processing times. International Journal of Production Research. 51(8). 2352–2362. 11 indexed citations

16.

Shahvari, Omid, Nasser Salmasi, Rasaratnam Logendran, & Babak Abbasi. (2011). An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems. International Journal of Production Research. 50(15). 4237–4254. 52 indexed citations

17.

Salmasi, Nasser, Rasaratnam Logendran, & M. Reza Skandari. (2009). Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Computers & Operations Research. 37(1). 199–212. 78 indexed citations

18.

Salmasi, Nasser, et al.. (2009). A tight lower bound for makespan minimization sequence dependent flowshop group scheduling problems. 86–89. 4 indexed citations

19.

Salmasi, Nasser & Rasaratnam Logendran. (2007). A heuristic approach for multi-stage sequence-dependent group scheduling problems. Journal of industrial engineering international. 4(7). 48–58. 11 indexed citations

20.

Mansouri, S. Afshin, et al.. (2007). Bicriteria two-machine flowshop scheduling using metaheuristics. 909–909. 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.

Explore authors with similar magnitude of impact