Talel Ladhari

Available identifiers

Publication	Date of Publication	Type
Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates	2023-11-16	Paper
Tight lower bounds for the traveling salesman problem with draft limits	2023-07-04	Paper
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking	2018-10-31	Paper
Strong multi-commodity flow formulations for the asymmetric traveling salesman problem	2018-07-25	Paper
The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies	2015-07-29	Paper
Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times	2013-11-08	Paper
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	2012-11-15	Paper
Minimizing maximum lateness in a flow shop subject to release dates	2007-06-25	Paper
A computational study of the permutation flow shop problem based on a tight lower bound	2005-05-12	Paper
A branch-and-bound-based local search method for the flow shop problem	2005-04-04	Paper
Minimising Maximum Lateness in a Two-Machine Flowshop	2005-01-10	Paper

This page was built for person: Talel Ladhari