Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems I Kacem, S Hammadi, P Borne IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and …, 2002 | 1072 | 2002 |
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic I Kacem, S Hammadi, P Borne Mathematics and computers in simulation 60 (3-5), 245-276, 2002 | 769 | 2002 |
A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems AA Kadri, I Kacem, K Labadi Computers & Industrial Engineering 95, 41-52, 2016 | 133 | 2016 |
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times I Kacem, C Chu, A Souissi Computers & operations research 35 (3), 827-844, 2008 | 100 | 2008 |
Genetic algorithm for the flexible job-shop scheduling problem I Kacem SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems …, 2003 | 96 | 2003 |
A linear programming approach for the three-dimensional bin-packing problem M Hifi, I Kacem, S Nègre, L Wu Electronic Notes in Discrete Mathematics 36, 993-1000, 2010 | 92 | 2010 |
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times R Mellouli, C Sadfi, C Chu, I Kacem European Journal of Operational Research 197 (3), 1150-1165, 2009 | 91 | 2009 |
Assignment and scheduling in flexible job-shops by hierarchical optimization N Zribi, I Kacem, A El Kamel, P Borne IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and …, 2007 | 76 | 2007 |
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval I Kacem Journal of Combinatorial Optimization 17, 117-133, 2009 | 70 | 2009 |
Community extraction and visualization in social networks applied to Twitter Y Abdelsadek, K Chelghoum, F Herrmann, I Kacem, B Otjacques Information Sciences 424, 204-223, 2018 | 67 | 2018 |
Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval I Kacem Computers & Industrial Engineering 54 (3), 401-410, 2008 | 67 | 2008 |
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval I Kacem, AR Mahjoub Computers & Industrial Engineering 56 (4), 1708-1712, 2009 | 63 | 2009 |
Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period I Kacem, C Chu European Journal of Operational Research 187 (3), 1080-1089, 2008 | 62 | 2008 |
Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint I Kacem, C Chu International Journal of Production Economics 112 (1), 138-150, 2008 | 62 | 2008 |
Universality of lower hybrid waves at Earth's magnetopause DB Graham, YV Khotyaintsev, C Norgren, A Vaivads, M André, JF Drake, ... Journal of Geophysical Research: Space Physics 124 (11), 8727-8760, 2019 | 48 | 2019 |
Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods M Rebai, I Kacem, KH Adjallah Journal of Intelligent Manufacturing 23, 1207-1224, 2012 | 43 | 2012 |
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date I Kacem Discrete Applied Mathematics 158 (9), 1035-1040, 2010 | 41 | 2010 |
Ordonnancement multicritère des job-shops flexibles: formulation, bornes inférieures et approche évolutionniste coopérative I Kacem Lille 1, 2003 | 41 | 2003 |
No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates F Ben Chihaoui, I Kacem, AB Hadj-Alouane, N Dridi, N Rezg International Journal of Production Research 49 (21), 6273-6286, 2011 | 39 | 2011 |
Algorithms for the bin packing problem with overlapping items A Grange, I Kacem, S Martin Computers & Industrial Engineering 115, 331-341, 2018 | 33 | 2018 |