Haouari Mohamed

Mohamed Haouari

Information about the author Mohamed Haouari will soon be added to the site.
Found 32 papers in total
A branch-and-bound-based local search method for the flow shop problem
A branch-and-bound-based local search method for the flow shop problem
2003
It is well-known that exact branch and bound methods can only solve small or...
Minimizing makespan on parallel machines subject to release dates and delivery times
Minimizing makespan on parallel machines subject to release dates and delivery times
2002
We consider the problem of minimizing the makespan on identical parallel machines...
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines
2003
In this paper, we introduce a new concept of semi-preemptive scheduling and we show...
Optimal cropping patterns under water deficits
Optimal cropping patterns under water deficits
2001
A mathematical programming model is proposed for optimal cropping patterns under water...
An economic order quantity lot sizing model with random supplier capacity
An economic order quantity lot sizing model with random supplier capacity
1999
This paper presents a general formulation of the inventory lot sizing model with...
Shortest path problems with time windows constraints: Application to vehicle routing
Shortest path problems with time windows constraints: Application to vehicle routing
1997
We solve the time dependent shortest path problem. This problem consists in finding a...
Heuristic algorithms for the two-stage hybrid flowshop problem
Heuristic algorithms for the two-stage hybrid flowshop problem
1997
A two-stage Hybrid Flowshop Problem (FS m 1 , m 2 ) is a two-center shop with several...
Vehicle routing and scheduling with time windows: The state of the art
Vehicle routing and scheduling with time windows: The state of the art
1990
The authors describe the state-of-the-art in vehicle routing and scheduling with time...
Papers per page: