Moshe Kaspi

1.3k total citations
33 papers, 1.0k citations indexed

About

Moshe Kaspi is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Management Information Systems. According to data from OpenAlex, Moshe Kaspi has authored 33 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Industrial and Manufacturing Engineering, 14 papers in Computer Networks and Communications and 9 papers in Management Information Systems. Recurrent topics in Moshe Kaspi's work include Scheduling and Optimization Algorithms (17 papers), Optimization and Search Problems (13 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Moshe Kaspi is often cited by papers focused on Scheduling and Optimization Algorithms (17 papers), Optimization and Search Problems (13 papers) and Advanced Manufacturing and Logistics Optimization (8 papers). Moshe Kaspi collaborates with scholars based in Israel, United States and Canada. Moshe Kaspi's co-authors include Dvir Shabtay, Meir J. Rosenblatt, J. M. A. Tanchoco, Tzvi Raz, Liron Yedidsion, ‪Yael Perlman‬‏, George Steiner, T. Raz, Ephraim Korach and I. Halachmi and has published in prestigious journals such as Management Science, European Journal of Operational Research and International Journal of Production Economics.

In The Last Decade

Moshe Kaspi

32 papers receiving 957 citations

Peers

Moshe Kaspi
Gerd Finke France
Tamás Kis Hungary
Christos Koulamas United States
Rasaratnam Logendran United States
Mary E. Kurz United States
Yih‐Long Chang United States
Louis A. Martin-Vega United States
Nima Zaerpour United States
Gerd Finke France
Moshe Kaspi
Citations per year, relative to Moshe Kaspi Moshe Kaspi (= 1×) peers Gerd Finke

Countries citing papers authored by Moshe Kaspi

Since Specialization
Citations

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

Fields of papers citing papers by Moshe Kaspi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Moshe Kaspi

This figure shows the co-authorship network connecting the top 25 collaborators of Moshe Kaspi. A scholar is included among the top collaborators of Moshe Kaspi 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 Moshe Kaspi. Moshe Kaspi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kaspi, Moshe, et al.. (2019). Maximizing the profit per unit time for the travelling salesman problem. Computers & Industrial Engineering. 135. 702–710. 5 indexed citations
2.
Hermelin, Danny, et al.. (2016). Parameterized complexity of critical node cuts. Theoretical Computer Science. 651. 62–75. 2 indexed citations
3.
Kaspi, Moshe, et al.. (2016). Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times. Journal of the Operational Research Society. 68(10). 1177–1182. 2 indexed citations
4.
Shabtay, Dvir, et al.. (2012). A survey on offline scheduling with rejection. Journal of Scheduling. 16(1). 3–28. 193 indexed citations
5.
Yedidsion, Liron, Dvir Shabtay, & Moshe Kaspi. (2011). Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discrete Applied Mathematics. 159(12). 1264–1278. 10 indexed citations
6.
Shabtay, Dvir, et al.. (2011). A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system. International Journal of Production Economics. 136(1). 67–74. 23 indexed citations
7.
Shabtay, Dvir, Moshe Kaspi, & George Steiner. (2007). The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times. IIE Transactions. 39(5). 539–557. 27 indexed citations
8.
Leisman, Gerry, et al.. (2007). COMPUTATIONAL AND NONCOMPUTATIONAL SYSTEMS IN BRAIN AND COGNITION: CAN ONE MASK THE OTHER?. International Journal of Neuroscience. 117(5). 681–710. 1 indexed citations
9.
Shabtay, Dvir & Moshe Kaspi. (2006). Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function. Naval Research Logistics (NRL). 53(3). 204–216. 10 indexed citations
10.
Perlman‬‏, ‪Yael & Moshe Kaspi. (2006). Centralized decision of internal transfer-prices with congestion externalities for two modes of repair with limited repair capacity. Journal of the Operational Research Society. 58(9). 1178–1184. 8 indexed citations
11.
Kaspi, Moshe & Dvir Shabtay. (2003). Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies. International Journal of Production Research. 41(10). 2229–2247. 24 indexed citations
12.
Shabtay, Dvir & Moshe Kaspi. (2003). The efficiency range of economical cutting conditions and tool replacement under the age replacement strategy. International Journal of Production Research. 41(11). 2563–2580. 6 indexed citations
13.
Shabtay, Dvir & Moshe Kaspi. (2003). Minimizing the total weighted flow time in a single machine with controllable processing times. Computers & Operations Research. 31(13). 2279–2289. 75 indexed citations
14.
Shabtay, Dvir & Moshe Kaspi. (2002). Optimization of the machining economics problem under the failure replacement strategy. International Journal of Production Economics. 80(3). 213–230. 11 indexed citations
15.
Perlman‬‏, ‪Yael, et al.. (2001). Setting expediting repair policy in a multi-echelon repairable-item inventory system with limited repair capacity. Journal of the Operational Research Society. 52(2). 198–209. 24 indexed citations
16.
Kaspi, Moshe & T. Raz. (1994). Optimal sequencing of production and inspection operations. International Journal of Production Research. 32(1). 209–221. 5 indexed citations
17.
Raz, Tzvi & Moshe Kaspi. (1991). Location and sequencing of imperfect inspection operations in serial multi-stage production systems. International Journal of Production Research. 29(8). 1645–1659. 27 indexed citations
18.
Kaspi, Moshe & J. M. A. Tanchoco. (1990). Optimal flow path design of unidirectional AGV systems. International Journal of Production Research. 28(6). 1023–1030. 108 indexed citations
19.
Rosenblatt, Meir J. & Moshe Kaspi. (1985). Note—A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions. Management Science. 31(3). 369–373. 16 indexed citations
20.
Kaspi, Moshe & Meir J. Rosenblatt. (1985). The effectiveness of heuristic algorithms for multi-item inventory systems with joint replenishment costs. International Journal of Production Research. 23(1). 109–116. 30 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

Rankless by CCL
2026