| 2009 |
|---|
| 10 | EE | Imed Kacem:
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.
J. Comb. Optim. 17(2): 117-133 (2009) |
| 2008 |
|---|
| 9 | EE | Imed Kacem,
Chengbin Chu,
Ahmed Souissi:
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times.
Computers & OR 35(3): 827-844 (2008) |
| 8 | EE | Imed Kacem,
Chengbin Chu:
Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period.
European Journal of Operational Research 187(3): 1080-1089 (2008) |
| 7 | EE | Imed Kacem,
Chengbin Chu:
Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic.
Int. J. Computer Integrated Manufacturing 21(4): 388-395 (2008) |
| 2007 |
|---|
| 6 | EE | Nozha Zribi,
Imed Kacem,
Abdelkader E. Kamel,
Pierre Borne:
Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization.
IEEE Transactions on Systems, Man, and Cybernetics, Part C 37(4): 652-661 (2007) |
| 2005 |
|---|
| 5 | | Imed Kacem:
Flexible Job-Shop Scheduling Problems.
Encyclopedia of Information Science and Technology (II) 2005: 1197-1200 |
| 2004 |
|---|
| 4 | EE | Ahmed Souissi,
Imed Kacem,
Chengbin Chu:
Minimizing total tardiness on a single machine with sequence-dependent setup times.
SMC (2) 2004: 1481-1485 |
| 2003 |
|---|
| 3 | EE | Imed Kacem:
Scheduling Flexible Job-Shops: A Worst Case Analysis And An Evolutionary Algorithm.
International Journal of Computational Intelligence and Applications 3(4): 437-452 (2003) |
| 2002 |
|---|
| 2 | | Imed Kacem,
Slim Hammadi,
Pierre Borne:
Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems.
IEEE Transactions on Systems, Man, and Cybernetics, Part C 32(1): 1-13 (2002) |
| 1 | | Imed Kacem,
Slim Hammadi,
Pierre Borne:
Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems".
IEEE Transactions on Systems, Man, and Cybernetics, Part C 32(2): 172 (2002) |
