| A variable neighbourhood search algorithm for the open vehicle routing problem K Fleszar, IH Osman, KS Hindi European Journal of Operational Research 195 (3), 803-809, 2009 | 284 | 2009 |
| New heuristics for one-dimensional bin-packing K Fleszar, KS Hindi Computers & operations research 29 (7), 821-839, 2002 | 265 | 2002 |
| Solving the resource-constrained project scheduling problem by a variable neighbourhood search K Fleszar, KS Hindi European Journal of Operational Research 155 (2), 402-413, 2004 | 234 | 2004 |
| Dynamic economic dispatch for large scale power systems: a Lagrangian relaxation approach KS Hindi, MR Ab Ghani International Journal of Electrical Power & Energy Systems 13 (1), 51-56, 1991 | 186 | 1991 |
| Minimum-weight spanning tree algorithms a survey and empirical study CF Bazlamaçcı, KS Hindi Computers & Operations Research 28 (8), 767-785, 2001 | 136 | 2001 |
| An evolutionary algorithm for resource-constrained project scheduling KS Hindi, H Yang, K Fleszar IEEE Transactions on evolutionary computation 6 (5), 512-518, 2002 | 126 | 2002 |
| An enumerative heuristic and reduction methods for the assembly line balancing problem K Fleszar, KS Hindi European Journal of Operational Research 145 (3), 606-620, 2003 | 118 | 2003 |
| Design of low-voltage distribution networks: a mathematical programming method KS Hindi, A Brameller Proceedings of the Institution of Electrical Engineers 124 (1), 54-58, 1977 | 108 | 1977 |
| An effective VNS for the capacitated p-median problem K Fleszar, KS Hindi European Journal of Operational Research 191 (3), 612-622, 2008 | 105 | 2008 |
| Assignment of program modules to processors: A simulated annealing approach Y Hamam, KS Hindi European Journal of Operational Research 122 (2), 509-513, 2000 | 99 | 2000 |
| Efficient solution of large scale, single-source, capacitated plant location problems KS Hindi, K Pieńkosz Journal of the operational Research Society 50, 268-274, 1999 | 89 | 1999 |
| Solving the CLSP by a tabu search heuristic KS Hindi Journal of the Operational Research Society 47, 151-161, 1996 | 79 | 1996 |
| Computationally Efficient Solution of a Multiproduct, Two-Stage Distribution—Location Problem KS Hindi, T Basta Journal of the Operational Research Society 45, 1316-1323, 1994 | 71 | 1994 |
| An effective heuristic for the CLSP with set-up times KS Hindi, K Fleszar, C Charalambous Journal of the Operational Research Society 54 (5), 490-498, 2003 | 68 | 2003 |
| Single-machine batch scheduling minimizing weighted flow times and delivery costs MM Mazdeh, S Shashaani, A Ashouri, KS Hindi Applied Mathematical Modelling 35 (1), 563-570, 2011 | 67 | 2011 |
| Fast, effective heuristics for the 0–1 multi-dimensional knapsack problem K Fleszar, KS Hindi Computers & Operations Research 36 (5), 1602-1607, 2009 | 57 | 2009 |
| Efficient solution of a multi‐commodity, two‐stage distribution problem with constraints on assignment of customers to distribution centres KS Hindi, T Basta, K Pieńkosz International Transactions in Operational Research 5 (6), 519-527, 1998 | 57 | 1998 |
| A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times MM Mazdeh, M Sarhadi, KS Hindi Computers & Operations Research 35 (4), 1099-1111, 2008 | 55 | 2008 |
| Formulation and solution of a selection and sequencing problem in car manufacture KS Hindi, G Ploszajski Computers & industrial engineering 26 (1), 203-211, 1994 | 55 | 1994 |
| A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times K Fleszar, C Charalambous, KS Hindi Journal of Intelligent Manufacturing 23 (5), 1949-1958, 2012 | 51 | 2012 |
Krzysztof FleszarProfessor, American University of Beirut, Olayan School of BusinessEmail verificata su aub.edu.lb
