Talel Ladhari

Orcid: 0000-0002-5648-1398

According to our database1, Talel Ladhari authored at least 33 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Tight lower bounds for the Traveling Salesman Problem with draft limits.
Comput. Oper. Res., June, 2023

Intelligent Scheduling Algorithms for the Enhancement of Drone-Based Innovative Logistic Supply Chain Systems.
IEEE Access, 2023

2020
A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates.
Oper. Res., 2020

2019
Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates.
Int. Trans. Oper. Res., 2019

2018
A Genetic Algorithm-Based Classification Approach for Multicriteria ABC Analysis.
Int. J. Inf. Technol. Decis. Mak., 2018

Strong multi-commodity flow formulations for the asymmetric traveling salesman problem.
Eur. J. Oper. Res., 2018

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking.
Ann. Oper. Res., 2018

A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints.
IEEE Access, 2018

2017
Nodes Migration Scheduling of Access Networks.
IEEE Trans. Netw. Serv. Manag., 2017

2016
An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem.
Polibits, 2016

A Novel Multi-criteria Inventory Classification Approach: Artificial Bee Colony Algorithm with VIKOR Method.
Proceedings of the Computer and Information Sciences - 31st International Symposium, 2016

A New Hybrid Multi-criteria ABC Inventory Classification Model Based on Differential Evolution and Topsis.
Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016), 2016

Multiple Criteria Inventory Classification Approach Based on Differential Evolution and Electre III.
Proceedings of the 16th International Conference on Hybrid Intelligent Systems (HIS 2016), 2016

Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm.
Proceedings of the Artificial Intelligence Perspectives in Intelligent Systems, 2016

2015
A parallel algorithm for solving the PFSP with load balancing on the grid: An empirical study.
Proceedings of the 5th International Conference on Information & Communication Technology and Accessibility, 2015

A proposal four-based-view framework to evaluate optimization tools.
Proceedings of the 4th International Conference on Systems and Control, 2015

Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling: Heuristic Approaches.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization.
Proceedings of the Multi-Agent Systems and Agreement Technologies, 2015

2014
Genetic Algorithm to infer criteria weights for Multicriteria Inventory Classification.
Proceedings of the International Conference on Control, 2014

2013
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.
Eur. J. Oper. Res., 2013

A distributed algorithm for the Permutation Flow Shop Problem - An empirical analysis.
Proceedings of the Parallel Computing: Accelerating Computational Science and Engineering (CSE), 2013

Scalable Distributed Branch and Bound for the Permutation Flow Shop Problem.
Proceedings of the Eighth International Conference on P2P, 2013

2012
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times.
J. Oper. Res. Soc., 2012

Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates.
Comput. Oper. Res., 2012

A Load Balanced Distributed Algorithm to Solve the Permutation Flow Shop Problem Using the Grid.
Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012

2010
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.
Electron. Notes Discret. Math., 2010

Design of parallel distributed algorithm for the Permutation Flow Shop Problem.
Proceedings of the NOTERE 2010, Annual International Conference on New Technologies of Distributed Systems, Touzeur, Tunisia, May 31, 2010

A Parallel Distributed Algorithm for the Permutation Flow Shop Scheduling Problem.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2010

Deployment of Solving Permutation Flow Shop Scheduling Problem on the Grid.
Proceedings of the Grid and Distributed Computing, Control and Automation, 2010

2007
Minimizing maximum lateness in a flow shop subject to release dates.
J. Oper. Res. Soc., 2007

2005
A computational study of the permutation flow shop problem based on a tight lower bound.
Comput. Oper. Res., 2005

2003
A branch-and-bound-based local search method for the flow shop problem.
J. Oper. Res. Soc., 2003

2000
Minimising maximum lateness in a two-machine flowshop.
J. Oper. Res. Soc., 2000


  Loading...