Search Results - "Rebai, Maher"

Exact Biobjective Optimization Methods for Camera Coverage Problem in Three-Dimensional Areas by Rebai, Maher, le Berre, Matthieu, Hnaien, Faicel, Snoussi, Hichem

“…This paper deals with the problem of deploying necessary camera sensors ensuring the maximum sum of weighted target points in 3-D areas while minimizing the…”
Get full text

Hybrid differential evolution algorithms for the optimal camera placement problem by Brévilliers, Mathieu, Lepagnot, Julien, Idoumghar, Lhassane, Rebai, Maher, Kritter, Julien

“…Purpose This paper aims to investigate to what extent hybrid differential evolution (DE) algorithms can be successful in solving the optimal camera placement…”
Get full text

A Branch and Bound Algorithm for the Critical Grid Coverage Problem in Wireless Sensor Networks by Rebai, Maher, Le Berre, Matthieu, Hnaien, Faicel, Snoussi, Hichem, Khoukhi, Lyes

“…We aim to cover a grid fully by deploying the necessary wireless sensors while maintaining connectivity between the deployed sensors and a base station (the…”
Get full text

Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks by Rebai, Maher, Le berre, Matthieu, Snoussi, Hichem, Hnaien, Faicel, Khoukhi, Lyes

“…In this study, we aim to cover a sensing area by deploying a minimum number of wireless sensors while maintaining the connectivity between the deployed…”
Get full text

Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods by Rebai, Maher, Kacem, Imed, Adjallah, Kondo H.

“…In this paper, we consider the problem of scheduling a set of M preventive maintenance tasks to be performed on M machines. The machines are assigned to…”
Get full text

A novel MILP model for timely message delivery in real-time WSNs by Ghoul-Bousba, Nassima, Rebai, Maher, Bouallouche-Medjkoune, Louiza, Aissani, Djamil, Khoukhi, Lyes

“…Packet delivery delay minimization is a critical issue in Wireless Sensor Networks. In mission-critical applications, the sensed information is highly…”
Get full text

A Specific Heuristic Dedicated to a Coverage/Tracking Bi-objective Problem for Wireless Sensor Deployment by Le Berre, Matthieu, Rebai, Maher, Hnaien, Faicel, Snoussi, Hichem

“…In recent years, wireless sensor networks (WSN) have become very attractive for surveillance applications and particularly for target tracking. When a target…”
Get full text

Scheduling jobs and maintenance activities on parallel machines by Rebai, Maher, Kacem, Imed, Adjallah, Kondo H.

“…In this article, we deal with the problem of scheduling N production jobs on M parallel machines. Each machine should be maintained once during the planning…”
Get full text

Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks by Rebai, Maher, Kacem, Imed, Adjallah, Kondo-Hloindo

“…In this paper, we consider the problem of scheduling a set of M preventive maintenance tasks to be performed on M machines. The machines are assigned to…”
Get full text

Linear models for the total coverage problem in wireless sensor networks by Rebai, Maher, Snoussi, Hichem, Khoukhi, Iyes, Hnaien, Faicel

“…In this paper, we consider the total grid coverage problem in wireless sensor networks. Our proposal aims to determine the optimal number of sensors and their…”
Get full text

Optimal placement in hybrid VANETs-sensors networks by Rebai, M., Khoukhi, L., Snoussi, H., Hnaien, F.

“…In this paper, we consider the total road coverage problem in hybrid VANET-Sensor networks. Our proposal aims to determine the optimal deployment of networked…”
Get full text

Minimizing the earliness-tardiness costs on a single machine by Rebai, M., Kacem, I.

“…This paper deals with the problem of scheduling a given set of independent jobs on a single machine to minimize the sum of early and tardy costs without…”
Get full text

Lower bounds for earliness-tardiness minimization on a single machine by Rebai, M., Kacem, I., Adjallah, K.H.

“…In this paper, we propose tow lower bounds for the problem of scheduling N-independent jobs on a single machine to minimize the sum of early and tardy costs…”
Get full text