default search action
Imed Kacem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j63]Mitsuo Gen, Ling Wang, Gursel Suer, Imed Kacem, Shi Cheng:
Intelligent optimization with learning for scheduling and logistics systems. Comput. Ind. Eng. 196: 110435 (2024) - [j62]Imed Kacem, Hans Kellerer
:
Minimizing the maximum lateness for scheduling with release times and job rejection. J. Comb. Optim. 48(3): 23 (2024) - [j61]Gais Alhadi, Imed Kacem
Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan. RAIRO Oper. Res. 58(3): 2393-2419 (2024) - 2023
- [j60]Imed Kacem
2-Dimensional packing on a variable size rectangular interface. Comput. Ind. Eng. 177: 109022 (2023) - [j59]Aristide Grange
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles. RAIRO Oper. Res. 57(1): 1-16 (2023) - [c43]Imad Assayakh
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. IWOCA 2023: 49-61 - 2022
- [j58]Youcef Abdelsadek, Imed Kacem
Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows. Comput. Ind. Eng. 165: 107876 (2022) - [j57]Mohamed Naceur Azaiez
Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling. Comput. Ind. Eng. 168: 108040 (2022) - [j56]Imed Kacem
Exact algorithms for scheduling programs with shared tasks. J. Comb. Optim. 43(5): 1602-1627 (2022) - [j55]Pascal Schroeder
Optimal solutions for online conversion problems with interrelated prices. Oper. Res. 22(1): 423-448 (2022) - 2021
- [j54]Imed Kacem
Preface: Recent advances in multiple objective optimization and goal programming. Ann. Oper. Res. 296(1): 1-5 (2021) - [j53]Imed Kacem
Preface: New trends on combinatorial optimization for network and logistical applications. Ann. Oper. Res. 298(1): 1-5 (2021) - [c42]Asma Fekih, Hatem Hadda, Imed Kacem
A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time. DeSE 2021: 443-447 - [c41]Mohamed Naceur Azaiez
Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model. ICNSC 2021: 1-5 - [c40]Bochra Djahel, Imed Kacem
On the Tardiness Minimization on Single Machine. ICNSC 2021: 1-6 - [c39]Aristide Grange, Imed Kacem
Approximate solutions for a special pagination problem with 2 symbols per tile. ICNSC 2021: 1-4 - [c38]Imed Kacem
Algorithms on a variable-size rectangular interface. ICNSC 2021: 1-6 - [c37]Rania Othman, Rim Faiz, Youcef Abdelsadek
Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis. IDA 2021: 50-62 - 2020
- [j52]Gais Alhadi
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines. Ann. Oper. Res. 285(1): 369-395 (2020) - [j51]Pascal Schroeder, Imed Kacem
Competitive difference analysis of the cash management problem with uncertain demands. Eur. J. Oper. Res. 283(3): 1183-1192 (2020) - [c36]Vincent Fagnon
Scheduling on Hybrid Platforms: Improved Approximability Window. LATIN 2020: 38-49 - [c35]Imed Kacem
Exact Algorithms for Scheduling Programs with Shared Tasks. WorldCIST (2) 2020: 435-444
2010 – 2019
- 2019
- [j50]Pascal Schroeder, Imed Kacem
Optimal cash management with uncertain, interrelated and bounded demands. Comput. Ind. Eng. 133: 195-206 (2019) - [j49]Fadel Abdallah
Genetic algorithms for scheduling in a CPU/FPGA architecture with heterogeneous communication delays. Comput. Ind. Eng. 137 (2019) - [j48]Imed Kacem
Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Discret. Appl. Math. 264: 76-89 (2019) - [j47]Pascal Schroeder
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. RAIRO Oper. Res. 53(2): 559-576 (2019) - [j46]Ahmed Abdelmoumene Kadri
Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems. Soft Comput. 23(14): 5945-5966 (2019) - [c34]Pascal Schroeder, Imed Kacem
New algorithms for online time series search with interrelated prices. CoDIT 2019: 1682-1687 - [c33]Imed Kacem
2-Dimensional packing algorithms on a variable-size rectangular interface. CoDIT 2019: 2022-2026 - [c32]Rania Othman, Youcef Abdelsadek
Improving Sentiment Analysis in Twitter Using Sentiment Specific Word Embeddings. IDAACS 2019: 854-858 - [i7]Vincent Fagnon
Scheduling on Hybrid Platforms: Improved Approximability Window. CoRR abs/1912.03088 (2019) - 2018
- [j45]Imed Kacem
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Algorithmica 80(12): 3825-3843 (2018) - [j44]Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah
NDSC based methods for maximizing the lifespan of randomly deployed wireless sensor networks for infrastructures monitoring. Comput. Ind. Eng. 115: 17-25 (2018) - [j43]Aristide Grange
Algorithms for the bin packing problem with overlapping items. Comput. Ind. Eng. 115: 331-341 (2018) - [j42]Runliang Dou
Industry Applications of Computational Intelligence: Preface. Int. J. Comput. Intell. Syst. 11(1): 803-804 (2018) - [j41]Youcef Abdelsadek
Community extraction and visualization in social networks applied to Twitter. Inf. Sci. 424: 204-223 (2018) - [j40]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. J. Comb. Optim. 36(3): 1074-1101 (2018) - [c31]Gais Alhadi
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. CoDIT 2018: 757-762 - [c30]Yacine Benziani, Imed Kacem
Genetic Algorithm for Open Shop Scheduling Problem. CoDIT 2018: 935-939 - [c29]Imed Kacem
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ICCL 2018: 417-427 - [i6]Gais Alhadi
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. CoRR abs/1802.10488 (2018) - 2017
- [j39]Imed Kacem
Applications of Optimization Methods to Industrial Engineering Problems. Comput. Ind. Eng. 112: 467-468 (2017) - [j38]Imed Kacem
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. RAIRO Oper. Res. 51(4): 1177-1188 (2017) - [c28]Imed Kacem, Telmo Reis Cunha, Valerie Botta-Genoulaz
Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios". CoDIT 2017: 17 - [c27]Fadel Abdallah, Camel Tanougast
A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. CoDIT 2017: 294-299 - [c26]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem
Mathematical formulation for open shop scheduling problem. CoDIT 2017: 803-808 - [i5]Imed Kacem, Christophe Rapine:
Approximation Algorithms for the Open Shop Problem with Delivery Times. CoRR abs/1706.02019 (2017) - [i4]Imed Kacem
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints. CoRR abs/1708.05102 (2017) - 2016
- [j37]Ahmed Abdelmoumene Kadri
A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. Comput. Ind. Eng. 95: 41-52 (2016) - [j36]Imed Kacem
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. J. Comb. Optim. 32(3): 970-981 (2016) - [j35]Imed Kacem
Foreword - Advanced Optimization Approaches and Modern OR-Applications. RAIRO Oper. Res. 50(4-5): 677-679 (2016) - [j34]Imed Kacem
Semi-online scheduling on a single machine with unexpected breakdown. Theor. Comput. Sci. 646: 40-48 (2016) - [c25]Pascal Schroeder, Günter Schmidt
Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. CoDIT 2016: 28-33 - [c24]Ayet Allah Ferjani, Noureddine Liouane, Imed Kacem
Task allocation for wireless sensor network using logic gate-based evolutionary algorithm. CoDIT 2016: 654-658 - [c23]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem
Valid inequalities for unrelated parallel machines scheduling with precedence constraints. CoDIT 2016: 677-682 - [c22]Bao-Thien Hoang, Kamel Chelghoum
A learning-based model for predicting information diffusion in social networks: Case of Twitter. CoDIT 2016: 752-757 - [c21]Bao-Thien Hoang, Kamel Chelghoum
Modeling Information Diffusion via Reputation Estimation. DEXA (1) 2016: 136-150 - [c20]Youcef Abdelsadek
Visual Interactive Approach for Mining Twitter's Networks. DMBD 2016: 342-349 - [c19]Sana Khalfa, Nizar Rokbani
PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS. HIS 2016: 558-566 - [c18]Isabelle Pecci
Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses. HSI 2016: 497-503 - [c17]Youcef Abdelsadek
On the Community Identification in Weighted Time-Varying Networks. ICSIBO 2016: 111-123 - [c16]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. ISCO 2016: 308-319 - [i3]Aristide Grange, Imed Kacem, Sébastien Martin:
Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. CoRR abs/1605.00558 (2016) - [i2]Youcef Abdelsadek
Triangles as basis to detect communities: an application to Twitter's network. CoRR abs/1606.05136 (2016) - [i1]Youcef Abdelsadek
On the visualization of the detected communities in dynamic networks: A case study of Twitter's network. CoRR abs/1611.04506 (2016) - 2015
- [j33]Walid Hfaiedh, Cherif Sadfi, Imed Kacem
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Appl. Math. Comput. 252: 496-502 (2015) - [j32]Youcef Abdelsadek
Branch-and-bound algorithm for the maximum triangle packing problem. Comput. Ind. Eng. 81: 147-157 (2015) - [j31]Imed Kacem
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. J. Comb. Optim. 30(3): 403-412 (2015) - [c15]Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah
Genetic algorithm based scheduling method for lifespan extension of a wireless sensors network. IDAACS 2015: 611-617 - 2014
- [j30]Imed Kacem
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Discret. Appl. Math. 164: 154-160 (2014) - [c14]Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem
Unrelated parallel machines with precedence constraints: application to cloud computing. CloudNet 2014: 438-442 - [c13]Vahid Farrokhi, Imed Kacem
Ranking the solution techniques for reactive scheduling problem in operating room. CoDIT 2014: 1-6 - [c12]Walid Hfaiedh, Cherif Sadfi, Imed Kacem
An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. CoDIT 2014: 288-291 - [c11]Imed Kacem
Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ISCO 2014: 305-314 - 2013
- [j29]Racem Mellouli
Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1‖∑wiCiPm, hj1‖∑wiCi scheduling problem. Appl. Math. Comput. 219(22): 10783-10805 (2013) - [j28]Imed Kacem
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Discret. Optim. 10(1): 61-68 (2013) - [j27]Maher Rebai, Imed Kacem
Scheduling jobs and maintenance activities on parallel machines. Oper. Res. 13(3): 363-383 (2013) - [c10]Imed Kacem
Effective algorithms for scheduling problems under non-availability constraints (Invited paper). ICSCS 2013: 162-169 - [c9]Imed Kacem
Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. ICNSC 2013: 388-391 - [c8]Yacine Benziani, Imed Kacem
Lower bounds for the makespan minimization in job shops. ICNSC 2013: 442-445 - 2012
- [j26]Rabia Nessah, Imed Kacem
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res. 39(3): 471-478 (2012) - [j25]Said Ben Messaoud, Imed Kacem:
Guest Editorial: Advanced Combinatorial Optimization and Applications. Int. J. Comb. Optim. Probl. Informatics 3(3): 1-2 (2012) - [j24]Maher Rebai, Imed Kacem
Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. J. Intell. Manuf. 23(4): 1207-1224 (2012) - [j23]Imed Kacem
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. RAIRO Oper. Res. 46(2): 125-147 (2012) - 2011
- [j22]Imed Kacem
Foreword: Combinatorial optimization for industrial engineering. Comput. Ind. Eng. 61(2): 239-241 (2011) - [j21]Imed Kacem
Erratum to "Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval" [Comput. Ind. Eng. 56(2009) 1708-1712]. Comput. Ind. Eng. 61(4): 1351 (2011) - [j20]Imed Kacem
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. J. Sched. 14(3): 257-265 (2011) - [c7]Maher Rebai, Imed Kacem
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. Discret. Appl. Math. 158(9): 1035-1040 (2010) - [j18]Makram Zaidi
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Electron. Notes Discret. Math. 36: 543-550 (2010) - [j17]Mhand Hifi, Imed Kacem
A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Electron. Notes Discret. Math. 36: 993-1000 (2010) - [j16]Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem
A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. Int. J. Appl. Metaheuristic Comput. 1(2): 34-49 (2010) - [c6]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
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. Oper. Res. 2009: 732010:1-732010:20 (2009) - [j13]Imed Kacem
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Comput. Ind. Eng. 56(4): 1708-1712 (2009) - [j12]Racem Mellouli
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Eur. J. Oper. Res. 197(3): 1150-1165 (2009) - [j11]Nizar Souayah, Imed Kacem
Scheduling on parallel identical machines to minimise the total weighted tardiness. Int. J. Adv. Oper. Manag. 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. Comput. Ind. Eng. 54(3): 401-410 (2008) - [j8]Imed Kacem
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Comput. Oper. Res. 35(3): 827-844 (2008) - [j7]Imed Kacem
Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Eur. J. Oper. Res. 187(3): 1080-1089 (2008) - [j6]Imed Kacem
Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Int. J. Comput. Integr. Manuf. 21(4): 388-395 (2008) - 2007
- [j5]Nozha Zribi, Imed Kacem
Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization. IEEE Trans. Syst. Man Cybern. Part C 37(4): 652-661 (2007) - 2005
- [c5]Imed Kacem, Cherif Sadfi, Abdelkader 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
- [c4]Ahmed Souissi, Imed Kacem
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. Int. J. Comput. Intell. Appl. 3(4): 437-452 (2003) - [c3]Imed Kacem:
Genetic algorithm for the flexible job-shop scheduling problem. SMC 2003: 3464-3469 - 2002
- [j3]Imed Kacem
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math. Comput. Simul. 60(3-5): 245-276 (2002) - [j2]Imed Kacem
Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans. Syst. Man Cybern. Part C 32(1): 1-13 (2002) - [j1]Imed Kacem
Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems". IEEE Trans. Syst. Man Cybern. Part C 32(2): 172 (2002) - [c2]Imed Kacem, Slim Hammadi, Pierre Borne:
Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs). SMC (2) 2002: 7 - 2001
- [c1]Imed Kacem, Slim Hammadi, Pierre Borne:
Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem. SMC 2001: 2599-2604
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: