Issmail El Hallaoui
RetourCahiers du GERAD
54 résultats — page 3 de 3
The integral simplex using decomposition (ISUD) algorithm <font size=2>[Zaghrouti, A., Soumis, F., Elhallaoui, I.: Integral simplex using decomposition for t...
référence BibTeX
Starting from the improved primal simplex (IPS) decomposition, introduced by Elhallaoui et al. (2011) to tackle degeneracy in general linear programs, we int...
référence BibTeXMultilevel hybrid method for solving buffer sizing and inspection stations allocation problems
This paper develops an efficient method to solve a typical combinatorial optimization problem that is frequently encountered when designing high levels of pr...
référence BibTeX
We propose a primal algorithm for the Set Partitioning Problem based on the Integral Simplex Using Decomposition of Zaghrouti et al. (2014). We present the a...
référence BibTeX
Since its introduction in 1969, the set partitioning problem has received much attention, and the structure of its feasible domain has been studied in detail...
référence BibTeX
The buffer sizing problem in unreliable production lines is a complex combinatorial optimization problem. In the formulation of the problem, the system consi...
référence BibTeXBuffer Dimensioning and Control Stations Positioning with a Space Partitioning-Tabu Search Approach
We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production li...
référence BibTeXAn Exact Method for Solving the Buffer Sizing and Inspection Stations Allocations Problem
An unreliable single part type transfer line with fixed inter machine buffer sizes is considered. In general, imperfect machines operating with imperfect raw...
référence BibTeX
Since the 1970's, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an ...
référence BibTeXIntegrated Airline Crew Scheduling: A Bi-Dynamic Constraint Aggregation Method using Neighborhoods
The integrated crew scheduling (ICS) problem consists of determining, for a set of available crew members, least-cost schedules that cover all flights and re...
référence BibTeX
Traditionally, the airline crew scheduling problem has been decomposed into a crew pairing and a crew assignment problem that are solved sequentially. The f...
référence BibTeX
The bidline scheduling problem with equity arises in several North American airlines. It consists of determining anonymous monthly schedules, called bidlines...
référence BibTeX
Since its appearance in 1947, the primal simplex algorithm has been one of the most popular algorithm for solving linear programs. It is very efficient wh...
référence BibTeX
Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...
référence BibTeX