K.S. Hindi

2.4k total citations
62 papers, 1.7k citations indexed

About

K.S. Hindi is a scholar working on Industrial and Manufacturing Engineering, Management Information Systems and Control and Systems Engineering. According to data from OpenAlex, K.S. Hindi has authored 62 papers receiving a total of 1.7k indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Industrial and Manufacturing Engineering, 12 papers in Management Information Systems and 11 papers in Control and Systems Engineering. Recurrent topics in K.S. Hindi's work include Scheduling and Optimization Algorithms (30 papers), Advanced Manufacturing and Logistics Optimization (16 papers) and Assembly Line Balancing Optimization (11 papers). K.S. Hindi is often cited by papers focused on Scheduling and Optimization Algorithms (30 papers), Advanced Manufacturing and Logistics Optimization (16 papers) and Assembly Line Balancing Optimization (11 papers). K.S. Hindi collaborates with scholars based in United Kingdom, Lebanon and Poland. K.S. Hindi's co-authors include Krzysztof Fleszar, Mohd Ruddin Ab Ghani, Yskandar Hamam, Ibrahim H. Osman, Mohammad Mahdavi Mazdeh, A. Brameller, M. Sarhadi, Mohamed Eid, Mohamed I. Dessouky and C. Charalambous and has published in prestigious journals such as Automatica, European Journal of Operational Research and International Journal for Numerical Methods in Engineering.

In The Last Decade

K.S. Hindi

60 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
K.S. Hindi United Kingdom 26 1.1k 256 229 198 183 62 1.7k
Kurt Jörnsten Norway 23 605 0.6× 356 1.4× 238 1.0× 139 0.7× 255 1.4× 113 1.6k
Y.P. Aneja Canada 20 951 0.9× 248 1.0× 168 0.7× 72 0.4× 276 1.5× 97 1.7k
Berna Dengiz Türkiye 22 658 0.6× 293 1.1× 245 1.1× 90 0.5× 174 1.0× 74 1.5k
Paulo Morelato França Brazil 24 1.1k 1.0× 169 0.7× 72 0.3× 291 1.5× 223 1.2× 55 1.5k
José A. Ventura United States 27 1.1k 1.0× 134 0.5× 270 1.2× 670 3.4× 251 1.4× 138 2.2k
Ada Che China 31 1.8k 1.7× 172 0.7× 229 1.0× 232 1.2× 386 2.1× 98 2.6k
Fulya Altıparmak Türkiye 21 1.2k 1.1× 222 0.9× 218 1.0× 419 2.1× 328 1.8× 44 2.3k
Djamila Ouelhadj United Kingdom 22 1.3k 1.2× 112 0.4× 238 1.0× 148 0.7× 288 1.6× 61 1.9k
Alessandro Agnetis Italy 25 1.8k 1.6× 300 1.2× 220 1.0× 236 1.2× 249 1.4× 101 2.3k
John G. Klincewicz United States 18 882 0.8× 247 1.0× 108 0.5× 114 0.6× 82 0.4× 39 1.4k

Countries citing papers authored by K.S. Hindi

Since Specialization
Citations

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

Fields of papers citing papers by K.S. Hindi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of K.S. Hindi

This figure shows the co-authorship network connecting the top 25 collaborators of K.S. Hindi. A scholar is included among the top collaborators of K.S. Hindi 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 K.S. Hindi. K.S. Hindi 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.
Fleszar, Krzysztof & K.S. Hindi. (2018). Algorithms for the unrelated parallel machine scheduling problem with a resource constraint. European Journal of Operational Research. 271(3). 839–848. 55 indexed citations
2.
Fleszar, Krzysztof, C. Charalambous, & K.S. Hindi. (2011). A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times. Journal of Intelligent Manufacturing. 23(5). 1949–1958. 28 indexed citations
3.
Mazdeh, Mohammad Mahdavi, et al.. (2010). Single-machine batch scheduling minimizing weighted flow times and delivery costs. Applied Mathematical Modelling. 35(1). 563–570. 42 indexed citations
4.
Fleszar, Krzysztof, Ibrahim H. Osman, & K.S. Hindi. (2007). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research. 195(3). 803–809. 156 indexed citations
5.
Mazdeh, Mohammad Mahdavi, M. Sarhadi, & K.S. Hindi. (2006). A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times. Computers & Operations Research. 35(4). 1099–1111. 43 indexed citations
6.
Fleszar, Krzysztof & K.S. Hindi. (2002). An enumerative heuristic and reduction methods for the assembly line balancing problem. European Journal of Operational Research. 145(3). 606–620. 82 indexed citations
7.
Hindi, K.S., et al.. (2001). Minimum-weight spanning tree algorithms A survey and empirical study. Computers & Operations Research. 28(8). 767–785. 61 indexed citations
8.
Hamam, Yskandar & K.S. Hindi. (2000). Assignment of program modules to processors: A simulated annealing approach. European Journal of Operational Research. 122(2). 509–513. 44 indexed citations
9.
Dessouky, Mohamed I., K.S. Hindi, & Mohamed Eid. (1999). Proceedings of the 24th international conference on Computers and industrial engineering. Annual Conference on Computers. 76 indexed citations
10.
Hindi, K.S.. (1996). Solving the CLSP by a Tabu Search Heuristic. Journal of the Operational Research Society. 47(1). 151–161. 33 indexed citations
11.
Hindi, K.S.. (1995). Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups. Journal of the Operational Research Society. 46(4). 465–472. 12 indexed citations
12.
Hindi, K.S., et al.. (1995). Detailed scheduling of batch production in a cell with parallel facilities and common renewable resources. Computers & Industrial Engineering. 28(4). 839–850. 6 indexed citations
13.
Hindi, K.S., et al.. (1994). Formulation and solution of a selection and sequencing problem in car manufacture. Computers & Industrial Engineering. 26(1). 203–211. 29 indexed citations
14.
Hindi, K.S. & Yskandar Hamam. (1994). Solving the part families problem in discrete-parts manufacture by simulated annealing. Production Planning & Control. 5(2). 160–164. 3 indexed citations
15.
Li, Zhuang & K.S. Hindi. (1993). Approximate decomposition for closed queueing network models of FMSs with a block-and-wait and state-dependent routing mechanism. European Journal of Operational Research. 67(3). 373–386. 9 indexed citations
16.
Belarbi, Khaled & K.S. Hindi. (1992). Detailed scheduling for a class of two-stage intermittent manufacturing systems. Production Planning & Control. 3(1). 36–47. 5 indexed citations
17.
Hindi, K.S. & Yskandar Hamam. (1991). Pressure control for leakage minimization in water supply networks Part 1: Single period models. International Journal of Systems Science. 22(9). 1573–1585. 18 indexed citations
18.
Hindi, K.S.. (1982). Practical Reliability Engineering. Electronics and Power. 28(1). 112–112. 102 indexed citations
19.
Hamam, Yskandar, et al.. (1980). Unit commitment of thermal generation. IEE Proceedings Generation, Transmission and Distribution [see also IEE Proceedings-Generation, Transmission and Distribution]. 127(1). 3–8. 6 indexed citations
20.
Hindi, K.S., A. Brameller, & Yskandar Hamam. (1976). Optimal cable profile of l.v. radial distributors. Two mathematical programming methods. Proceedings of the Institution of Electrical Engineers. 123(4). 331–331. 3 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