Haouari Mohamed

Mohamed Haouari

Information about the author Mohamed Haouari will soon be added to the site.
Found 32 papers in total
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem
A Novel Model and Decomposition Approach for the Integrated Airline Fleet Assignment, Aircraft Routing, and Crew Pairing Problem
2017
Given a daily flight schedule and a set of aircraft fleets, the airline scheduling...
Solving a large-scale crew pairing problem
Solving a large-scale crew pairing problem
2015
Airline companies seek to solve the problem of determining an assignment of crews to a...
A preemptive bound for the Resource Constrained Project Scheduling Problem
A preemptive bound for the Resource Constrained Project Scheduling Problem
2014
The Resource Constrained Project Scheduling Problem is one of the most intensively...
A model for enhancing robustness of aircraft and passenger connections
A model for enhancing robustness of aircraft and passenger connections
2013
Airlines schedules are often subject to various uncontrollable factors that cause...
Optimal scheduling of the 3‐machine assembly‐type flow shop
Optimal scheduling of the 3‐machine assembly‐type flow shop
1999
We address the 3‐Machine Assembly‐Type Flowshop Scheduling Problem...
Branch‐and‐bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Branch‐and‐bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
2012
This paper deals with the parallel‐machine scheduling problem with the aim of...
Enhanced energetic reasoning‐based lower bounds for the resource constrained project scheduling problem
Enhanced energetic reasoning‐based lower bounds for the resource constrained project scheduling problem
2012
We present new and effective lower bounds for the resource constrained project...
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Exact approaches for integrated aircraft fleeting and routing at TunisAir
2011
We describe models and exact solutions approaches for an integrated aircraft fleeting...
Bounding strategies for the hybrid flow shop scheduling problem
Bounding strategies for the hybrid flow shop scheduling problem
2011
In this paper, we investigate new lower and upper bounds for the...
Relaxations and exact solution of the variable sized bin packing problem
Relaxations and exact solution of the variable sized bin packing problem
2011
We address a generalization of the classical one‐dimensional bin packing...
Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach
Integrated Airline Schedule Design and Fleet Assignment: Polyhedral Analysis and Benders' Decomposition Approach
2010
The main airline operations consist of schedule planning, fleet assignment, aircraft...
Maximizing the minimum completion time on parallel machines
Maximizing the minimum completion time on parallel machines
2008
We propose an exact branch–and–bound algorithm for the problem of...
The prize collecting Steiner tree problem: models and Lagrangean dual optimization approaches
The prize collecting Steiner tree problem: models and Lagrangean dual optimization approaches
2008
We propose a generalized version of the Prize Collecting Steiner Tree Problem (PCSTP),...
Tight bounds for the identical parallel machine-scheduling problem: Part II
Tight bounds for the identical parallel machine-scheduling problem: Part II
2008
A companion paper introduces new lower bounds and heuristics for the problem of...
Supplier selection and order lot sizing modeling: A review
Supplier selection and order lot sizing modeling: A review
2007
With globalization and the emergence of the extended enterprise of interdependent...
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
2007
Network design problems arise in a wide range of applied areas including...
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
2007
We address the makespan minimization for parallel identical machines subject to heads...
Tight bounds for the identical parallel machine scheduling problem
Tight bounds for the identical parallel machine scheduling problem
2006
We address the problem of minimizing makespan on identical parallel machines. We...
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
2006
We consider the version of prize collecting Steiner tree problem (PCSTP) where each...
Upper and lower bounding strategies for the generalized minimum spanning tree problem
Upper and lower bounding strategies for the generalized minimum spanning tree problem
2006
We address the generalized minimum spanning tree problem which requires spanning at...
A computational study of the permutation flow shop problem based on a tight lower bound
A computational study of the permutation flow shop problem based on a tight lower bound
2005
We consider the classical permutation flow shop problem which requires scheduling n...
A bi-objective model for robust resource-constrained project scheduling
A bi-objective model for robust resource-constrained project scheduling
2005
A common problem which arises in project management is the fact that the planned...
Optimal scheduling of the 3-machine assembly-type flow shop
Optimal scheduling of the 3-machine assembly-type flow shop
1999
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This...
Lower bounds for scheduling on identical parallel machines with heads and tails
Lower bounds for scheduling on identical parallel machines with heads and tails
2004
In this paper, we investigate new lower bounds for the P|r j ,q j |C max...
Papers per page: