#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (5)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mohamed Haouari, Mohamed Kharbeche
- Computers & OR
- 2013

We present an assignment-based lower bound that is valid for a wide class of two-machine flow shop problems with a regular additive performance criterion. We provide empirical evidence that this new bound consistently outperforms state-of-the-art lower bounds in two important special cases: F2J P Cj and F2J P Tj. Moreover, we illustrate its wide… (More)

- Jacques Carlier, Mohamed Haouari, Mohamed Kharbeche, Aziz Moukrim
- European Journal of Operational Research
- 2010

This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transportation robot and a blocking constraint. We propose an approximate decomposition algorithm. The proposed approach breaks the problem into two scheduling problems that are solved… (More)

- Mohamed Kharbeche, Jacques Carlier, Mohamed Haouari, Aziz Moukrim
- Electronic Notes in Discrete Mathematics
- 2010

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 NP-hard problem. In this paper, we propose a new mathematical formulation and we describe a new lower bound for the RCP. In addition, we propose a genetic algorithm.… (More)

- Anis Gharbi, Mohamed Naceur Azaiez, Mohamed Kharbeche
- Electronic Notes in Discrete Mathematics
- 2010

A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attacker cannot launch an attack if its cost is beyond his available budget or its probability of success falls below a threshold level. The proposed branch-andbound algorithm includes,… (More)

- Mohamed Kharbeche, Mohamed Haouari
- JORS
- 2013

We propose compact mixed-integer programming models for the NP-hard problem of minimizing tardiness in a two-machine flow shop. Also, we propose valid inequalities that aim at tightening the models’ representations. We provide empirical evidence that the linear programming relaxation of an enhanced formulation yields an excellent lower bound that… (More)

- Mehdi Mrad, Anis Gharbi, Mohamed Haouari, Mohamed Kharbeche
- Annals OR
- 2016

- Deepti Muley, Wael K. M. Alhajyaseen, Mohamed Kharbeche
- ANT/SEIT
- 2017

- Deepti Muley, Mohamed Kharbeche, Wael K. M. Alhajyaseen, Mohammed Al-Salem
- ANT/SEIT
- 2017

Given a job set J = f1; 2; :::; ng where each job has to be processed non preemptively on m machines M1; M2;..., Mm in that order. The processing time of job j on machine Mi is pij : At time t = 0; all jobs are available at an input device denoted by M0: After completion, each job must be taken from Mm to an output device denoted Mm+1 (for convenience, we… (More)

- ‹
- 1
- ›