Scheduling with Communication Delays and Data Routing in Message Passing Architectures. - Aziz Moukrim; Alain Quilliot (IPPS/SPDP Workshops, 1998)

Parallel Implementation of a Generalized Conjugate Gradient Algorithm. - Jonas Koko; Aziz Moukrim (Informatica, 1998)

Scheduling with Communication Delays and On-Line Disturbances. - Aziz Moukrim; Eric Sanlaville; Frédéric Guinand (Euro-Par, 1999)

On the minimum number of processors for scheduling problems with communicationdelays. - Aziz Moukrim (Ann. Oper. Res., 1999)

Non-preemptive Profile Scheduling and Quasi Interval Orders. - Aziz Moukrim (Electron. Notes Discret. Math., 1999)

Optimal scheduling on parallel machines for a new order class. - Aziz Moukrim (Oper. Res. Lett., 1999)

Upper bound on the number of processors for scheduling with interprocessor communication delays. - Aziz Moukrim (Math. Methods Oper. Res., 2000)

Optimal Schedules of Coffman-Graham Algorithm for a New Order Class. - Marc Chardon; Aziz Moukrim (IPDPS, 2001)

New Lower and Upper Bounds for Graph Treewidth. - François Clautiaux; Jacques Carlier; Aziz Moukrim; Stéphane Nègre (WEA, 2003)

Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders. - Aziz Moukrim (Discret. Appl. Math., 2003)

Parallel Machine Scheduling with Uncertain Communication Delays. - Aziz Moukrim; Eric Sanlaville; Frédéric Guinand (RAIRO Oper. Res., 2003)

Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem. - Corinne Lucet; Florence Mendes; Aziz Moukrim (WEA, 2004)

Sensitivity analysis of tree scheduling on two machines with communication delays. - Frédéric Guinand; Aziz Moukrim; Eric Sanlaville (Parallel Comput., 2004)

Heuristic and metaheuristic methods for computing graph treewidth. - François Clautiaux; Aziz Moukrim; Stéphane Nègre; Jacques Carlier (RAIRO Oper. Res., 2004)

Optimal preemptive scheduling on a fixed number of identical parallel machines. - Aziz Moukrim; Alain Quilliot (Oper. Res. Lett., 2005)

The Coffman–Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders. - Marc Chardon; Aziz Moukrim (SIAM J. Discret. Math., 2005)

An exact method for graph coloring. - Corinne Lucet; Florence Mendes; Aziz Moukrim (Comput. Oper. Res., 2006)

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation. - Jacques Carlier; François Clautiaux; Aziz Moukrim (Comput. Oper. Res., 2007)

A new exact method for the two-dimensional orthogonal packing problem. - François Clautiaux; Jacques Carlier; Aziz Moukrim (Eur. J. Oper. Res., 2007)

A new exact method for the two-dimensional bin-packing problem with fixed orientation. - François Clautiaux; Jacques Carlier; Aziz Moukrim (Oper. Res. Lett., 2007)

A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. - François Clautiaux; Antoine Jouglet; Aziz Moukrim (WEA, 2008)

A new constraint programming approach for the orthogonal packing problem. - François Clautiaux; Antoine Jouglet; Jacques Carlier; Aziz Moukrim (Comput. Oper. Res., 2008)

New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. - Joseph El Hayek; Aziz Moukrim; Stéphane Nègre (Comput. Oper. Res., 2008)

Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time. - Fatma Hermès; Jacques Carlier; Aziz Moukrim; Khaled Ghédira (ICINCO-ICSO, 2009)

The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm. - Jacques Carlier; Aziz Moukrim; Huang Xu 002 (Discret. Appl. Math., 2009)

A polynomial algorithm for recognizing the Am-order class. - Aziz Moukrim; Eric Sanlaville (Discret. Math., 2009)

An MILP for scheduling problems in an FMS with one vehicle. - Anthony Caumond; Philippe Lacomme; Aziz Moukrim; Nikolay Tchernev (Eur. J. Oper. Res., 2009)

Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem. - Duc-Cuong Dang; Aziz Moukrim (IJCCI (ICEC), 2010)

A memetic algorithm for the team orienteering problem. - Hermann Bouly; Duc-Cuong Dang; Aziz Moukrim (4OR, 2010)

Exact resolution of the one-machine sequencing problem with no machine idle time. - Jacques Carlier; Fatma Hermès; Aziz Moukrim; Khaled Ghédira (Comput. Ind. Eng., 2010)

Exact Method for Robotic Cell Problem. - Mohamed Kharbeche; Jacques Carlier; Mohamed Haouari; Aziz Moukrim (Electron. Notes Discret. Math., 2010)

Lower Bounds for the Minimal Sum Coloring Problem. - Aziz Moukrim; K. Sghiouer; Corinne Lucet; Y. Li (Electron. Notes Discret. Math., 2010)

An optimization-based heuristic for the robotic cell problem. - Jacques Carlier; Mohamed Haouari; Mohamed Kharbeche; Aziz Moukrim (Eur. J. Oper. Res., 2010)

A PSO-Based Memetic Algorithm for the Team Orienteering Problem. - Duc-Cuong Dang; Rym Nesrine Guibadj; Aziz Moukrim (EvoApplications (2), 2011)

Subgraph extraction and metaheuristics for the maximum clique problem. - Duc-Cuong Dang; Aziz Moukrim (J. Heuristics, 2012)

Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows. - Rym Nesrine Guibadj; Aziz Moukrim (Artificial Evolution, 2013)

A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. - Duc-Cuong Dang; Racha El-Hajj; Aziz Moukrim (CPAIOR, 2013)

Branch and Price for Preemptive Resource Constrained Project Scheduling Problem Based on Interval Orders in Precedence Graphs. - Aziz Moukrim; Alain Quilliot; Hélène Toussaint (FedCSIS, 2013)

Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs. - Aziz Moukrim; Alain Quilliot; Hélène Toussaint (WCO@FedCSIS, 2013)

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints. - Sohaib Afifi; Duc-Cuong Dang; Aziz Moukrim (LION, 2013)

An Analysis Framework for Examination Timetabling. - Taha Arbaoui; Jean-Paul Boufflet; Aziz Moukrim (SOCS, 2013)

An effective PSO-inspired algorithm for the team orienteering problem. - Duc-Cuong Dang; Rym Nesrine Guibadj; Aziz Moukrim (Eur. J. Oper. Res., 2013)

A Memetic Algorithm for staff scheduling problem in airport security service. - Anas Abdoul Soukour; Laure Devendeville; Corinne Lucet; Aziz Moukrim (Expert Syst. Appl., 2013)

A New Graph-Theoretical Model for the Guillotine-Cutting Problem. - François Clautiaux; Antoine Jouglet; Aziz Moukrim (INFORMS J. Comput., 2013)

Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem. - Aziz Moukrim; Alain Quilliot; Hélène Toussaint (CoDIT, 2014)

New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows. - Sohaib Afifi; Rym Nesrine Guibadj; Aziz Moukrim (CPAIOR, 2014)

A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays. - Aziz Moukrim; Djamal Rebaine; Mehdi Serairi (RAIRO Oper. Res., 2014)

Preprocessing and an improved MIP model for examination timetabling. - Taha Arbaoui; Jean-Paul Boufflet; Aziz Moukrim (Ann. Oper. Res., 2015)

An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration. - Aziz Moukrim; Alain Quilliot; Hélène Toussaint (Eur. J. Oper. Res., 2015)

Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays. - Mohamed Amine Mkadem; Aziz Moukrim; Mehdi Serairi (OR, 2016)

Solving the team orienteering problem with cutting planes. - Racha El-Hajj; Duc-Cuong Dang; Aziz Moukrim (Comput. Oper. Res., 2016)

Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. - Sohaib Afifi; Duc-Cuong Dang; Aziz Moukrim (Optim. Lett., 2016)

A branch-and-bound algorithm for the two-machine flow-shop problem with time delays. - Mohamed Amine Mkadem; Aziz Moukrim; Mehdi Serairi (CoDIT, 2017)

Hybrid Heuristic for the Clustered Orienteering Problem. - Ala-Eddine Yahiaoui; Aziz Moukrim; Mehdi Serairi (ICCL, 2017)

A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution. - Philippe Lacomme; Aziz Moukrim; Alain Quilliot; Marina Vinot (Eng. Appl. Artif. Intell., 2017)

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem. - Youcef Amarouche; Rym Nesrine Guibadj; Aziz Moukrim (ATMOS, 2018)

Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources. - Jacques Carlier; Aziz Moukrim; Abderrahim Sahli (Discret. Appl. Math., 2018)

Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product. - Philippe Lacomme; Aziz Moukrim; Alain Quilliot; Marina Vinot (Int. J. Prod. Res., 2018)

Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems. - Taha Arbaoui; Jean-Paul Boufflet; Aziz Moukrim (Comput. Oper. Res., 2019)

The clustered team orienteering problem. - Ala-Eddine Yahiaoui; Aziz Moukrim; Mehdi Serairi (Comput. Oper. Res., 2019)

Integration of routing into a resource-constrained project scheduling problem. - Philippe Lacomme; Aziz Moukrim; Alain Quilliot; Marina Vinot (EURO J. Comput. Optim., 2019)

A variable space search heuristic for the Capacitated Team Orienteering Problem. - Asma Ben-Said; Racha El-Hajj; Aziz Moukrim (J. Heuristics, 2019)

A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit. - Racha El-Hajj; Rym Nesrine Guibadj; Aziz Moukrim; Mehdi Serairi (Ann. Oper. Res., 2020)

Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows. - Youcef Amarouche; Rym Nesrine Guibadj; Elhadja Chaalal; Aziz Moukrim (Comput. Oper. Res., 2020)

Exact method for the two-machine flow-shop problem with time delays. - Mohamed Amine Mkadem; Aziz Moukrim; Mehdi Serairi (Ann. Oper. Res., 2021)

The student scheduling problem at Université de Technologie de Compiègne. - Jean-Paul Boufflet; Taha Arbaoui; Aziz Moukrim (Expert Syst. Appl., 2021)

Polynomial algorithms for some scheduling problems with one nonrenewable resource. - Abderrahim Sahli; Jacques Carlier; Aziz Moukrim (RAIRO Oper. Res., 2021)

An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem. - Quentin Peña; Aziz Moukrim; Mehdi Serairi (EA, 2022)

Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows. - Asma Ben-Said; Aziz Moukrim; Rym Nesrine Guibadj; Jérôme Verny (Comput. Oper. Res., 2022)

Surgery planning for elective patients: A dedicated heuristic and an effective ALNS. - Lahcene Mezouari; Jean-Paul Boufflet; Aziz Moukrim (Eng. Appl. Artif. Intell., 2022)

Scheduling in an Emergency Department, Linear Formulation and Heuristic Approach. - Lahcene Mezouari; Lucas Wicher; Jean-Paul Boufflet; Aziz Moukrim (CoDIT, 2023)

GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows. - Ala-Eddine Yahiaoui; Aziz Moukrim; Mehdi Serairi (Int. Trans. Oper. Res., 2023)

Effective adaptive large neighborhood search for a firefighters timetabling problem. - Mohamed-Amine Ouberkouk; Jean-Paul Boufflet; Aziz Moukrim (J. Heuristics, 2023)