The following pages link to Talel Ladhari (Q724059):
Displaying 11 items.
- Strong multi-commodity flow formulations for the asymmetric traveling salesman problem (Q724060) (← links)
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking (Q1615967) (← links)
- 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 (Q1762109) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- (Q2861538) (← links)
- Minimising Maximum Lateness in a Two-Machine Flowshop (Q3156650) (← links)
- A branch-and-bound-based local search method for the flow shop problem (Q4661161) (← links)
- Minimizing maximum lateness in a flow shop subject to release dates (Q5292803) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
