Browsing by OzU Authors "Haouari, Mohamed"
Now showing items 120 of 28

Algorithmic expedients for the prize collecting Steiner tree problem
Haouari, Mohamed; Layeb, S. B.; Sherali, H. D. (Elsevier, 2010)This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the wellknown Steiner tree problem. Given a root node, edge costs, node prizes and penalties, as well as ... 
Approximation algorithms for single machine scheduling with one unavailability period
Kacem, I.; Haouari, Mohamed (Springer Nature, 200903)In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomialtime approximation scheme when ... 
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
Sherali, H. D.; Bae, K.H.; Haouari, Mohamed (Springer Science+Business Media, 201311)The airline’s ability to offer flight schedules that provide service to passengers at desired times in competitive markets, while matching demand with an aircraft fleet of suitable size and composition, can significantly ... 
Bounding strategies for the hybrid flow shop scheduling problem
Hidri, L.; Haouari, Mohamed (Elsevier, 20110701)In this paper, we investigate new lower and upper bounds for the multiplecenter hybrid flow shop scheduling problem. We propose a family of centerbased lower bounds as well as a destructive lower bound that is based on ... 
A branchandcut algorithm for the Steiner tree problem with delays
Leggieri, V.; Haouari, Mohamed; Triki, C. (Springer Science+Business Media, 201212)In this paper, we investigate the Steiner tree problem with delays, which is a generalized version of the Steiner tree problem applied to multicast routing. For this challenging combinatorial optimization problem, we present ... 
A computational study of lower bounds for the two dimensional bin packing problem
Serairi, M.; Haouari, Mohamed (Elsevier, 20100801)We survey lower bounds for the variant of the twodimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti ... 
Development of lower bounds for the scheduling of setup tasks in serial production lines
Pessan, C.; Neron, E.; Haouari, Mohamed (Inderscience Publishers, 2013)Efficient production resettings are necessary to achieve production flexibility. For this reason, it is of primary importance to reduce the setup time required to switch the production from one product type to another, and ... 
Discrepancy search for the flexible job shop scheduling problem
Hmida, A. B.; Haouari, Mohamed; Huguet, M.J.; Lopez, P. (Elsevier, 201012)The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim ... 
Discrete time/cost tradeoff problem: a decompositionbased solutionalgorithm for the budget version
Hazır, Ö.; Haouari, Mohamed; Erel, E. (Elsevier, 201004)This paper investigates the budget variant of the discrete time/cost tradeoff problem (DTCTP). This multimode project scheduling problem requires assigning modes to the activities of a project so that the total completion ... 
Energetic reasoning revisited: application to parallel machine scheduling
Hidri, L.; Gharbi, A.; Haouari, Mohamed (Springer Science+Business Media, 200808)We consider the problem of minimizing makespan on identical parallel machines subject to release dates and delivery times. We present several new feasibility tests and adjustment techniques that consistently improve ... 
Enhanced energetic reasoningbased lower bounds for the resource constrained project scheduling problem
Haouari, Mohamed; Kooli, A.; Neron, E. (Elsevier, 201205)We present new and effective lower bounds for the resource constrained project scheduling problem. This problem is widely known to be notoriously difficult to solve due to the lack of lower bounds that are both tight and ... 
An exact algorithm for the Steiner tree problem with delays
Leggieri, V.; Haouari, Mohamed; Triki, C. (Elsevier, 20100801)The Steiner Tree Problem with Delays (STPD) is a variant of the wellknown Steiner Tree Problem in which the delay on each path between a source node and a terminal node is limited by a given maximum value. We propose a ... 
Exact approaches for integrated aircraft fleeting and routing at TunisAir
Haouari, Mohamed; Sherali, H. D.; Mansour, F. Z.; Aissaoui, N. (Science+Business Media, 201106)We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost ... 
Exact method for robotic cell problem
Kharbeche, M.; Carlier, J.; Haouari, Mohamed; Moukrim, A. (Elsevier, 20100801)This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NPhard problem. In this ... 
Exact methods for the robotic cell problem
Kharbeche, M.; Carlier, J.; Haouari, Mohamed; Moukrim, A. (Springer Science+Business Media, 201106)This paper investigates an exact method for the Robotic Cell Problem. We present a branchandbound algorithm which is the first exact procedure specifically designed with regard to this complex flow shop scheduling variant. ... 
Flexible aircraft fleeting and routing at TunisAir
Zeghal, F. M.; Haouari, Mohamed; Sherali, H. D.; Aissaoui, N. (Palgrave Macmillan, 201102)This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of ... 
Heuristics for the variable sized binpacking problem
Haouari, Mohamed; Serairi, M. (Elsevier, 200910)We investigate the onedimensional variablesized binpacking problem. This problem requires packing a set of items into a minimumcost set of bins of unequal sizes and costs. Six optimizationbased heuristics for this ... 
Integrated airline schedule design and fleet assignment: polyhedral analysis and benders’ decomposition approach
Sherali, H. D.; Bae, K.H.; Haouari, Mohamed (Informs, 201001)The main airline operations consist of schedule planning, fleet assignment, aircraft routing, and crew scheduling. To improve profitability, we present in this paper an integrated fleet assignment model with schedule ... 
IPbased energetic reasoning for the resource constrained project scheduling problem
Kooli, A.; Haouari, Mohamed; Hidri, L.; Neron, E. (Elsevier, 20100801)In this paper, we consider the Resource Constrained Project Scheduling Problem (RCPSP). New feasibility tests for the energetic reasoning are introduced based on new integer programming (IP) formulations. Experimental ... 
Optimal solution of the discrete cost multicommodity network design problem
Mrad, M.; Haouari, Mohamed (Elsevier, 20081015)We investigate a multicommodity network design problem where a discrete set of Technologies with stepincreasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design ...
Share this page