Welcome to my home page

photo

Accueil /Welcome

Enseignements/Teaching

Recherche/Research

Publications sélectionnées /Selected publications

 

Activités Editoriales/Editorial Activities

 

Autres activités scientifiques/Other Scientific Activities

 

 

Selected publications on APPROXIMATION ALGORITHMS

 

[1]   I. Kacem, H. Kellerer, Approximation algorithms for no-idle time scheduling on a single machine with release times and delivery times. Discrete Applied Mathematics, 2011,  doi:10.1016/j.dam.2011.07.005 (PDF).

 

http://www.elsevier.com/framework_products/images/98/702998.gif

[2]   I. Kacem, V. Th. Paschos, Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability. Discrete Optimization, 2012 (preliminary version available in Cahier du Lamsade n°305, University Paris-Dauphine, mars 2011).

 

[3]   I. Kacem, H. Kellerer, Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Journal of Scheduling 2011, Volume 14, Number 3, 257-265

 

[4]   I. Kacem, Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. Journal of Combinatorial Optimization 2009, 17:2,  117-133.

 

[5]   I. Kacem. Fully Polynomial-Time Approximation Scheme for the Weighted Total Tardiness Minimization with a Common Due Date. Discrete Applied Mathematics, 2010, Volume 158, Issue 9, Pages 1035-1040. 

 

[6]   I. Kacem, Approximation algorithm for the weighted flowtime minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering 2008, 54:3, 401-410.

 

[7]   I. Kacem, M. Haouari, Approximation algorithms for single machine scheduling with one unavailability period. 4OR: A Quarterly Journal of Operations Research 2009, 7:1, 79-92.

 

 

[8]   I. Kacem, C. Chu. Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research 2008, 187:3, 1080-1089.

 

 

[9]   I. Kacem, R.A. Mahjoub, Fully Polynomial Time Approximation Scheme for the Weighted Flow-time Minimization on a Single Machine with a Fixed Non-Availability Interval. Computers & Industrial Engineering 2009, 56:4, 1708-1712.

 

[10]                      I. Kacem, C. Chu. Minimizing the weighted flowtime on a single machine with resumable availability contraint : Worst-case of the WSPT heuristic. International Journal of Computer Integrated Manufacturing 2008, 21:4, 388 – 395.

 

http://www.inderscience.com/images/cover/scoverijps.jpg

[11]                      I. Kacem, Y. Lanuel, M. Sahnoune. Strongly Fully Polynomial Time Approximation Scheme for the Two-Parallel Capacitated Machines Scheduling Problem. International Journal of Planning and Scheduling 2011, 1:1, to appear.

 

Selected publications on EXACT ALGORITHMS

 

International Journal of Production Economics

[12]                      I. Kacem, C. Chu. Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint. International Journal of Production Economics 2008, 112:1, 138-150.

 

RAIRO - Operations Research

[13]                      I. Kacem, N. Souayah, M. Haouari. Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions, RAIRO - Operations Research / Volume46 / Issue02 / August 2012, pp 125-147.

 

Operational Research

[14]                      M. Rebai, I. Kacem, K. Adjallah. Scheduling Jobs and Maintenance Activities on Parallel Machines.
Operational Research: An International Journal (to appear).

 

[15]                      A. Bekrar, I. Kacem. An Exact Method for the 2D Guillotine Strip Packing Problem. Advances in Operations Research 2009, Volume 2009, doi:10.1155/2009/732010.

 

[16]                      I. Kacem, C. Chu, A. Souissi. Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Computers & Operations Research 2008, 35:3, 827 − 844.

 

[17]                      N. Souayah, I. Kacem, M. Haouari, C. Chu. Scheduling on parallel identical machines to minimise the total weighted tardiness. International Journal of Advanced Operations Management 2009, 1:1, 30-69.

 

http://images.springer.com/cda/content/image/cda_displayimage.jpg?SGWID=0-0-16-135476-0

[18]                      M. Rebai, I. Kacem, K.H. Adjallah, Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. Journal of Intelligent Manufacturing 2010, DOI: 10.1007/s10845-010-0425-0

 

[19]                      I. Kacem. Lower bounds for tardiness minimization on a single machine with family setup times. International Journal of Operations Research, vol 4, n◦4, pp 18-31, 2007.

 

 

http://www.tandf.co.uk/common/jcovers/websmall/T/TPRS.jpg

[20]                       F. Ben Chihaoui, I. Kacem, A. Ben Hadj-Alouane, N. Dridi, N. Rezg, 2011. No-wait scheduling of a two-machine flow-shop to minimise the makespan under non-availability constraints and different release dates, International Journal of Production Research, doi: 10.1080/00207543.2010.531775

 

[21]                      R. Mellouli, C. Sadfi, C. Chu, I. Kacem. Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. European Journal of Operational Research 2009, 197:3, 1150-1165.

 

[22]                      B. Bettayeb, I. Kacem, K.H. Adjallah. An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machine with family setup times. Journal of Systems Science and Systems Engineering 2008, 17:4, 446-459.

 

[23]                      A. Bekrar, I. Kacem, C. Chu, C. Sadfi. An improved heuristic and an exact algorithm for the 2D strip and bin packing problem International Journal of Product Development 2010, 10:1/2/3, 217-240

 

[24]                      M. Hifi, I. Kacem, S. Nègre, L. Wu. A Linear Programming Approach for the Three-Dimensional Bin-Packing Problems. Electronic Notes in Discrete Mathematics 2010, 36:1, 993-1000. 

 

 

[25]                      A. Bekrar, I. Kacem, C. Chu. A comparative study of exact algorithms for the two dimensional strip packing problem. Journal of Industrial Systems Engineering 2007, 1:2, 151-170.

 

 

Selected publications on METAHEURISTIC ALGORITHMS

 

[26]                      I. Kacem, S. Hammadi, P. Borne, Pareto-optimality Approach for Flexible Job-shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computers in Simulation 2002, 60, 245-276.

 

[27]                      N. Zribi, I. Kacem, A. El-Kamel, P. Borne. Assignment and scheduling in flexible job shops by hierarchical optimization. IEEE Transactions on Systems, Man and Cybernetics, Part C 2007, 37, 652-661.

 

[28]                      I. Kacem, S. Hammadi, P. Borne. Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-shop Scheduling Problems. IEEE Transactions on Systems, Man and Cybernetics, Part C 2002, 32:1, 1-13.

 

 

[29]                       A. Mellouli, F. Masmoudi, I. Kacem, M. Haddar. A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. International Journal of Applied Metaheuristic Computing 2010, 1:2, 34-49.

 

[30]                      M. Dridi, I. Kacem. Hybrid approach for scheduling transportation network. International Journal of Applied Mathematics and Computer Science 2004, 14:3, 397-409.