| A computational study of the permutation flow shop problem based on a tight lower bound T Ladhari, M Haouari Computers & Operations Research 32 (7), 1831-1847, 2005 | 97 | 2005 |
| On the inventory performance of multi-criteria classification methods: empirical investigation MZ Babai, T Ladhari, I Lajili International Journal of Production Research 53 (1), 279-290, 2015 | 90 | 2015 |
| A branch-and-bound-based local search method for the flow shop problem M Haouari, T Ladhari Journal of the Operational Research Society 54 (10), 1076-1084, 2003 | 53 | 2003 |
| Multi-criteria inventory classification: new consensual procedures T Ladhari, MZ Babai, I Lajili IMA journal of Management Mathematics 27 (2), 335-351, 2016 | 44 | 2016 |
| A genetic algorithm-based classification approach for multicriteria ABC analysis H Kaabi, K Jabeur, T Ladhari International Journal of Information Technology & Decision Making 17 (06 …, 2018 | 32 | 2018 |
| The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies A Gharbi, T Ladhari, MK Msakni, M Serairi European Journal of Operational Research 231 (1), 69-78, 2013 | 31 | 2013 |
| Minimizing the total completion time in a two-machine flowshop problem with time delays L Msakni, Khallouli, Al-Salem Engineering Optimization, 2015 | 26* | 2015 |
| Minimising maximum lateness in a two-machine flowshop M Haouari, T Ladhari Journal of the Operational Research Society 51 (9), 1100-1106, 2000 | 25 | 2000 |
| Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking N Nouri, T Ladhari Annals of Operations Research 267, 413-430, 2018 | 24 | 2018 |
| Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop T Ladhari, MA Rakrouki International Journal of Production Economics 122 (2), 678-691, 2009 | 22 | 2009 |
| Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates MA Rakrouki, T Ladhari, V T’kindt Computers & operations research 39 (6), 1257-1264, 2012 | 20 | 2012 |
| Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times T Ladhari, MK Msakni, A Allahverdi Journal of the Operational Research Society 63 (4), 445-459, 2012 | 18 | 2012 |
| A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates MA Rakrouki, A Kooli, S Chalghoumi, T Ladhari Operational Research 20, 21-35, 2020 | 14 | 2020 |
| A discrete artificial bee colony algorithm for resource-constrained project scheduling problem N Nouri, S Krichen, T Ladhari, P Fatimah 2013 5th International Conference on Modeling, Simulation and Applied …, 2013 | 14 | 2013 |
| Solving the permutation flow shop problem with makespan criterion using grids M Jemni, T Ladhari International Journal of Grid and Distributed Computing 4 (2), 53-64, 2011 | 13 | 2011 |
| A computational study of the two-machine no-wait flow shop scheduling problem subject to unequal release dates and non-availability constraints M Labidi, A Kooli, T Ladhari, A Gharbi, US Suryahatmaja IEEE Access 6, 16294-16304, 2018 | 12 | 2018 |
| Scalable distributed branch and bound for the permutation flow shop problem S Kouki, M Jemni, T Ladhari 2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and …, 2013 | 11 | 2013 |
| Strong multi-commodity flow formulations for the asymmetric traveling salesman problem A Balma, SB Salem, M Mrad, T Ladhari European Journal of Operational Research 271 (1), 72-79, 2018 | 9 | 2018 |
| A novel multi-criteria inventory classification approach: artificial bee colony algorithm with VIKOR method H Cherif, T Ladhari Computer and Information Sciences: 31st International Symposium, ISCIS 2016 …, 2016 | 9 | 2016 |
| A load balanced distributed algorithm to solve the permutation flow shop problem using the grid S Kouki, M Jemni, T Ladhari 2012 IEEE 15th International Conference on Computational Science and …, 2012 | 9 | 2012 |
