( en | de | ru )

 

Disambiguation of "Ladhari, Talel"

Author of the publication

copydeleteadd this publication to your clipboard
A distributed algorithm for the Permutation Flow Shop Problem - An empirical analysis.

, , and . PARCO, volume 25 of Advances in Parallel Computing, page 451-460. IOS Press, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Ladhari, Talel
add a person with the name Ladhari, Talel
 

Other publications of authors with the same name

Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling: Heuristic Approaches., and . GECCO, page 441-448. ACM, (2015)Nodes Migration Scheduling of Access Networks., , , and . IEEE Trans. Network and Service Management, 14 (1): 77-90 (2017)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., , and . Comput. Oper. Res., 39 (6): 1257-1264 (2012)Design of parallel distributed algorithm for the Permutation Flow Shop Problem., , and . NOTERE, page 65-72. IEEE, (2010)An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem., and . Polibits, (2016)Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates., , , and . ITOR, 26 (6): 2432-2449 (2019)A Genetic Algorithm-Based Classification Approach for Multicriteria ABC Analysis., , and . Int. J. Inf. Technol. Decis. Mak., 17 (6): 1805-1837 (2018)Total Tardiness Minimization in a Flow Shop with Blocking Using an Iterated Greedy Algorithm., and . CSOC (1), volume 464 of Advances in Intelligent Systems and Computing, page 93-102. Springer, (2016)A Particle Swarm Optimization Metaheuristic for the Blocking Flow Shop Scheduling Problem: Total Tardiness Minimization., and . EUMAS/AT, volume 9571 of Lecture Notes in Computer Science, page 145-153. Springer, (2015)Minimising maximum lateness in a two-machine flowshop., and . J. Oper. Res. Soc., 51 (9): 1100-1106 (2000)