Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Imed Kacem
2010 – today
- 2013
[j25]Imed Kacem, Vangelis Th. Paschos: Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discrete Optimization 10(1): 61-68 (2013)- 2012
[j24]Rabia Nessah, Imed Kacem: Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Computers & OR 39(3): 471-478 (2012)
[j23]Said Ben Messaoud, Imed Kacem: Guest Editorial: Advanced Combinatorial Optimization and Applications. IJCOPI 3(3): 1-2 (2012)
[j22]Imed Kacem, Nizar Souayah, Mohamed Haouari: Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO - Operations Research 46(2): 125-147 (2012)- 2011
[j21]Imed Kacem, Hans Kellerer: Foreword: Combinatorial optimization for industrial engineering. Computers & Industrial Engineering 61(2): 239-241 (2011)
[j20]Imed Kacem, Hans Kellerer: Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Scheduling 14(3): 257-265 (2011)
[c5]Maher Rebai, Imed Kacem, Kondo H. Adjallah: Evolutionary Algorithm for Scheduling Production Jobs and Preventive Maintenance Activities. Business Process Management Workshops (2) 2011: 152-161- 2010
[j19]Imed Kacem: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Discrete Applied Mathematics 158(9): 1035-1040 (2010)
[j18]Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil: Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electronic Notes in Discrete Mathematics 36: 543-550 (2010)
[j17]Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu: A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electronic Notes in Discrete Mathematics 36: 993-1000 (2010)
[j16]Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem, Mohamed Haddar: A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. Int. J. of Applied Metaheuristic Computing 1(2): 34-49 (2010)
[c4]Imed Kacem: New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. CTW 2010: 101-104
2000 – 2009
- 2009
[j15]Imed Kacem, Mohamed Haouari: Approximation algorithms for single machine scheduling with one unavailability period. 4OR 7(1): 79-92 (2009)
[j14]Abdelghani Bekrar, Imed Kacem: An Exact Method for the 2D Guillotine Strip Packing Problem. Adv. Operations Research 2009 (2009)
[j13]Imed Kacem, Ali Ridha 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 56(4): 1708-1712 (2009)
[j12]Racem Mellouli, Cherif Sadfi, Chengbin Chu, Imed Kacem: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. European Journal of Operational Research 197(3): 1150-1165 (2009)
[j11]Nizar Souayah, Imed Kacem, Mohamed Haouari, Chengbin Chu: Scheduling on parallel identical machines to minimise the total weighted tardiness. IJAOM 1(1): 30-69 (2009)
[j10]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
[j9]Imed Kacem: Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering 54(3): 401-410 (2008)
[j8]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)
[j7]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)
[j6]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
[j5]Nozha Zribi, Imed Kacem, Abdelkader El 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
[c3]Imed Kacem, Cherif Sadfi, Abdellcader El-Kamel: Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints. SMC 2005: 1657-1662
[r1]Imed Kacem: Flexible Job-Shop Scheduling Problems. Encyclopedia of Information Science and Technology (II) 2005: 1197-1200- 2004
[c2]Ahmed Souissi, Imed Kacem, Chengbin Chu: Minimizing total tardiness on a single machine with sequence-dependent setup times. SMC (2) 2004: 1481-1485- 2003
[j4]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)
[c1]- 2002
[j3]Imed Kacem, Slim Hammadi, Pierre Borne: Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60(3-5): 245-276 (2002)
[j2]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)
[j1]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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-10 22:50 CEST by the dblp team



