| 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 | 312 | 2009 |
| New heuristics for one-dimensional bin-packing K Fleszar, KS Hindi Computers & operations research 29 (7), 821-839, 2002 | 284 | 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 | 256 | 2004 |
| An evolutionary algorithm for resource-constrained project scheduling KS Hindi, H Yang, K Fleszar IEEE Transactions on Evolutionary Computation 6 (5), 512-518, 2002 | 132 | 2002 |
| An effective VNS for the capacitated p-median problem K Fleszar, KS Hindi European Journal of Operational Research 191 (3), 612-622, 2008 | 127 | 2008 |
| 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 | 127 | 2003 |
| Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem K Fleszar, C Charalambous European Journal of Operational Research 210 (2), 176-184, 2011 | 91 | 2011 |
| 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 | 72 | 2003 |
| Algorithms for the unrelated parallel machine scheduling problem with a resource constraint K Fleszar, KS Hindi European Journal of Operational Research 271 (3), 839-848, 2018 | 70 | 2018 |
| A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts C Charalambous, K Fleszar Computers & Operations Research 38 (10), 1443-1451, 2011 | 61 | 2011 |
| Fast, effective heuristics for the 0–1 multi-dimensional knapsack problem K Fleszar, KS Hindi Computers & Operations Research 36 (5), 1602-1607, 2009 | 60 | 2009 |
| Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts K Fleszar Computers & Operations Research 40 (1), 463-474, 2013 | 52 | 2013 |
| 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 | 52 | 2012 |
| A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem KS Hindi, K Fleszar Computers & Industrial Engineering 47 (1), 91-101, 2004 | 48 | 2004 |
| A branch-and-bound algorithm for the quadratic multiple knapsack problem K Fleszar European Journal of Operational Research 298 (1), 89-98, 2022 | 28 | 2022 |
| A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) K Fleszar European Journal of Operational Research 259 (1), 169-174, 2017 | 11 | 2017 |
| An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem K Fleszar INFORMS Journal on Computing 28 (4), 703-720, 2016 | 11 | 2016 |
| Hybrid of the weighted minimum slack and shortest processing time dispatching rules for the total weighted tardiness single machine scheduling problem with availability constraints I Osman, H Belouadah, K Fleszar, M Saffar Multidisciplinary International Conference on Scheduling: Theory and …, 2009 | 10 | 2009 |
| A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation K Fleszar European Journal of Operational Research 303 (1), 37-53, 2022 | 9 | 2022 |
| A new MILP model and fast heuristics for the variable-sized bin packing problem with time windows K Fleszar Computers & Industrial Engineering 175, 108849, 2023 | 7 | 2023 |
Khalil HindiProfessor, American University of BeirutAdresse e-mail validée de aub.edu.lb
