Imed Kacem
Orcid: 0000-0001-6649-7257
According to our database1,
Imed Kacem
authored at least 107 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2023
Comput. Ind. Eng., March, 2023
Fully polynomial time approximation scheme for the pagination problem with hierarchical structure of tiles.
RAIRO Oper. Res., January, 2023
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023
2022
Oper. Res., 2022
Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling.
Comput. Ind. Eng., 2022
Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows.
Comput. Ind. Eng., 2022
2021
Ann. Oper. Res., 2021
Preface: New trends on combinatorial optimization for network and logistical applications.
Ann. Oper. Res., 2021
Deep Hybrid Neural Networks with Improved Weighted Word Embeddings for Sentiment Analysis.
Proceedings of the Advances in Intelligent Data Analysis XIX, 2021
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021
Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021
A Random-key based genetic algorithm for the flexible job-shop scheduling minimizing total completion time.
Proceedings of the 14th International Conference on Developments in eSystems Engineering, 2021
2020
Competitive difference analysis of the cash management problem with uncertain demands.
Eur. J. Oper. Res., 2020
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines.
Ann. Oper. Res., 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems.
Soft Comput., 2019
Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices.
RAIRO Oper. Res., 2019
Complexity results for common due date scheduling problems with interval data and minmax regret criterion.
Discret. Appl. Math., 2019
Comput. Ind. Eng., 2019
Genetic algorithms for scheduling in a CPU/FPGA architecture with heterogeneous communication delays.
Comput. Ind. Eng., 2019
Proceedings of the 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2019
Proceedings of the 6th International Conference on Control, 2019
Proceedings of the 6th International Conference on Control, 2019
2018
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications.
J. Comb. Optim., 2018
Inf. Sci., 2018
Int. J. Comput. Intell. Syst., 2018
An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines.
CoRR, 2018
Comput. Ind. Eng., 2018
NDSC based methods for maximizing the lifespan of randomly deployed wireless sensor networks for infrastructures monitoring.
Comput. Ind. Eng., 2018
Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints.
Algorithmica, 2018
Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval.
Proceedings of the Computational Logistics - 9th International Conference, 2018
Proceedings of the 5th International Conference on Control, 2018
Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval.
Proceedings of the 5th International Conference on Control, 2018
2017
Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines.
RAIRO Oper. Res., 2017
Comput. Ind. Eng., 2017
Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios".
Proceedings of the 4th International Conference on Control, 2017
Proceedings of the 4th International Conference on Control, 2017
A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays.
Proceedings of the 4th International Conference on Control, 2017
2016
Theor. Comput. Sci., 2016
RAIRO Oper. Res., 2016
Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval.
J. Comb. Optim., 2016
CoRR, 2016
On the visualization of the detected communities in dynamic networks: A case study of Twitter's network.
CoRR, 2016
CoRR, 2016
A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems.
Comput. Ind. Eng., 2016
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016
Proceedings of the Swarm Intelligence Based Optimization - Second International Conference, 2016
Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses.
Proceedings of the 9th International Conference on Human System Interactions, 2016
Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016), 2016
Proceedings of the Data Mining and Big Data, First International Conference, 2016
Proceedings of the Database and Expert Systems Applications, 2016
Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates.
Proceedings of the International Conference on Control, 2016
A learning-based model for predicting information diffusion in social networks: Case of Twitter.
Proceedings of the International Conference on Control, 2016
Task allocation for wireless sensor network using logic gate-based evolutionary algorithm.
Proceedings of the International Conference on Control, 2016
Valid inequalities for unrelated parallel machines scheduling with precedence constraints.
Proceedings of the International Conference on Control, 2016
2015
Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals.
J. Comb. Optim., 2015
Comput. Ind. Eng., 2015
A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization.
Appl. Math. Comput., 2015
Genetic algorithm based scheduling method for lifespan extension of a wireless sensors network.
Proceedings of the IEEE 8th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, 2015
2014
Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times.
Discret. Appl. Math., 2014
An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization.
Proceedings of the International Conference on Control, 2014
Proceedings of the International Conference on Control, 2014
Unrelated parallel machines with precedence constraints: application to cloud computing.
Proceedings of the 3rd IEEE International Conference on Cloud Networking, 2014
2013
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability.
Discret. Optim., 2013
Lagrangian relaxation and column generation-based lower bounds for the <i>Pm</i>, <i>h</i><sub><i>j</i>1</sub>‖∑<i>w</i><sub><i>i</i></sub><i>C</i><sub><i>i</i></sub>Pm, hj1‖∑wiCi scheduling problem.
Appl. Math. Comput., 2013
Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval.
Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013
Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013
Effective algorithms for scheduling problems under non-availability constraints (Invited paper).
Proceedings of the 2nd International Conference on Systems and Computer Science, 2013
2012
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions.
RAIRO Oper. Res., 2012
Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods.
J. Intell. Manuf., 2012
Int. J. Comb. Optim. Probl. Informatics, 2012
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates.
Comput. Oper. Res., 2012
2011
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., 2011
Comput. Ind. Eng., 2011
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., 2011
Evolutionary Algorithm for Scheduling Production Jobs and Preventive Maintenance Activities.
Proceedings of the Business Process Management Workshops, 2011
2010
A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem.
Int. J. Appl. Metaheuristic Comput., 2010
Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines.
Electron. Notes Discret. Math., 2010
Electron. Notes Discret. Math., 2010
Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date.
Discret. Appl. Math., 2010
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.
J. Comb. Optim., 2009
Int. J. Adv. Oper. Manag., 2009
Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times.
Eur. J. Oper. Res., 2009
Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval.
Comput. Ind. Eng., 2009
Approximation algorithms for single machine scheduling with one unavailability period.
4OR, 2009
2008
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., 2008
Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period.
Eur. J. Oper. Res., 2008
Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times.
Comput. Oper. Res., 2008
Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval.
Comput. Ind. Eng., 2008
2007
IEEE Trans. Syst. Man Cybern. Part C, 2007
2005
Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints.
Proceedings of the IEEE International Conference on Systems, 2005
Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005
2004
Proceedings of the IEEE International Conference on Systems, 2004
2003
Int. J. Comput. Intell. Appl., 2003
Proceedings of the IEEE International Conference on Systems, 2003
2002
Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems".
IEEE Trans. Syst. Man Cybern. Part C, 2002
Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems.
IEEE Trans. Syst. Man Cybern. Part C, 2002
Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic.
Math. Comput. Simul., 2002
Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs).
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Yasmine Hammamet, Tunisia, October 6-9, 2002, 2002
2001
Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem.
Proceedings of the IEEE International Conference on Systems, 2001