Aziz Moukrim

77 papers A 1B 3C 6Journal 52Unranked 15
YearRankTypeTitle / Venue / Authors
2026 J jnl
A memory-enhanced Greedy Randomized Adaptive Search Procedure for the Multi-Pickup and Delivery Problem with Time Windows.
Comput. Oper. Res.
Salma Bouhlla, Rym Nesrine Guibadj, Aziz Moukrim
2025 C conf
A Multi-Start Tabu Search with Set Partitioning for the Green VRP.
CoDIT
Atef Dridi, Dalila Tayachi, Aziz Moukrim, Lamjed Ben Said
2023 J jnl
Effective adaptive large neighborhood search for a firefighters timetabling problem.
J. Heuristics
Mohamed-Amine Ouberkouk, Jean-Paul Boufflet, Aziz Moukrim
2023 J jnl
GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows.
Int. Trans. Oper. Res.
Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi
2023 C conf
Scheduling in an Emergency Department, Linear Formulation and Heuristic Approach.
CoDIT
Lahcene Mezouari, Lucas Wicher, Jean-Paul Boufflet, Aziz Moukrim
2022 — conf
An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem.
EA
Quentin Peña, Aziz Moukrim, Mehdi Serairi
2022 J jnl
Surgery planning for elective patients: A dedicated heuristic and an effective ALNS.
Eng. Appl. Artif. Intell.
Lahcene Mezouari, Jean-Paul Boufflet, Aziz Moukrim
2022 J jnl
Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows.
Comput. Oper. Res.
Asma Ben-Said, Aziz Moukrim, Rym Nesrine Guibadj, Jérôme Verny
2021 J jnl
Exact method for the two-machine flow-shop problem with time delays.
Ann. Oper. Res.
Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi
2021 J jnl
Polynomial algorithms for some scheduling problems with one nonrenewable resource.
RAIRO Oper. Res.
Abderrahim Sahli, Jacques Carlier, Aziz Moukrim
2021 J jnl
The student scheduling problem at Université de Technologie de Compiègne.
Expert Syst. Appl.
Jean-Paul Boufflet, Taha Arbaoui, Aziz Moukrim
2020 J jnl
A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit.
Ann. Oper. Res.
Racha El-Hajj, Rym Nesrine Guibadj, Aziz Moukrim, Mehdi Serairi
2020 J jnl
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows.
Comput. Oper. Res.
Youcef Amarouche, Rym Nesrine Guibadj, Elhadja Chaalal, Aziz Moukrim
2019 J jnl
A variable space search heuristic for the Capacitated Team Orienteering Problem.
J. Heuristics
Asma Ben-Said, Racha El-Hajj, Aziz Moukrim
2019 J jnl
Integration of routing into a resource-constrained project scheduling problem.
EURO J. Comput. Optim.
Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot
2019 J jnl
Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems.
Comput. Oper. Res.
Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim
2019 J jnl
The clustered team orienteering problem.
Comput. Oper. Res.
Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi
2018 C conf
A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem.
ATMOS
Youcef Amarouche, Rym Nesrine Guibadj, Aziz Moukrim
2018 J jnl
Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources.
Discret. Appl. Math.
Jacques Carlier, Aziz Moukrim, Abderrahim Sahli
2018 J jnl
Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product.
Int. J. Prod. Res.
Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot
2017 C conf
A branch-and-bound algorithm for the two-machine flow-shop problem with time delays.
CoDIT
Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi
2017 J jnl
A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution.
Eng. Appl. Artif. Intell.
Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot
2017 — conf
Hybrid Heuristic for the Clustered Orienteering Problem.
ICCL
Ala-Eddine Yahiaoui, Aziz Moukrim, Mehdi Serairi
2016 J jnl
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits.
Optim. Lett.
Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim
2016 — conf
Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays.
OR
Mohamed Amine Mkadem, Aziz Moukrim, Mehdi Serairi
2016 J jnl
Solving the Team Orienteering Problem with Cutting Planes.
CoRR
Racha El-Hajj, Duc-Cuong Dang, Aziz Moukrim
2016 J jnl
Solving the team orienteering problem with cutting planes.
Comput. Oper. Res.
Racha El-Hajj, Duc-Cuong Dang, Aziz Moukrim
2015 J jnl
An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration.
Eur. J. Oper. Res.
Aziz Moukrim, Alain Quilliot, Hélène Toussaint
2015 J jnl
Preprocessing and an improved MIP model for examination timetabling.
Ann. Oper. Res.
Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim
2014 J jnl
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays.
RAIRO Oper. Res.
Aziz Moukrim, Djamal Rebaine, Mehdi Serairi
2014 C conf
Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem.
CoDIT
Aziz Moukrim, Alain Quilliot, Hélène Toussaint
2014 B conf
New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows.
CPAIOR
Sohaib Afifi, Rym Nesrine Guibadj, Aziz Moukrim
2013 B conf
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem.
CPAIOR
Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim
2013 J jnl
A Memetic Algorithm for staff scheduling problem in airport security service.
Expert Syst. Appl.
Anas Abdoul Soukour, Laure Devendeville, Corinne Lucet, Aziz Moukrim
2013 J jnl
A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
INFORMS J. Comput.
François Clautiaux, Antoine Jouglet, Aziz Moukrim
2013 — conf
A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints.
LION
Sohaib Afifi, Duc-Cuong Dang, Aziz Moukrim
2013 B conf
An Analysis Framework for Examination Timetabling.
SOCS
Taha Arbaoui, Jean-Paul Boufflet, Aziz Moukrim
2013 J jnl
An effective PSO-inspired algorithm for the team orienteering problem.
Eur. J. Oper. Res.
Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim
2013 C conf
Branch and Price for Preemptive Resource Constrained Project Scheduling Problem Based on Interval Orders in Precedence Graphs.
FedCSIS
Aziz Moukrim, Alain Quilliot, Hélène Toussaint
2013 — conf
Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs.
WCO@FedCSIS
Aziz Moukrim, Alain Quilliot, Hélène Toussaint
2013 — conf
Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows.
Artificial Evolution
Rym Nesrine Guibadj, Aziz Moukrim
2012 J jnl
Subgraph extraction and metaheuristics for the maximum clique problem.
J. Heuristics
Duc-Cuong Dang, Aziz Moukrim
2011 — conf
A PSO-Based Memetic Algorithm for the Team Orienteering Problem.
EvoApplications (2)
Duc-Cuong Dang, Rym Nesrine Guibadj, Aziz Moukrim
2010 J jnl
A memetic algorithm for the team orienteering problem.
4OR
Hermann Bouly, Duc-Cuong Dang, Aziz Moukrim
2010 J jnl
An optimization-based heuristic for the robotic cell problem.
Eur. J. Oper. Res.
Jacques Carlier, Mohamed Haouari, Mohamed Kharbeche, Aziz Moukrim
2010 J jnl
Exact Method for Robotic Cell Problem.
Electron. Notes Discret. Math.
Mohamed Kharbeche, Jacques Carlier, Mohamed Haouari, Aziz Moukrim
2010 J jnl
Exact resolution of the one-machine sequencing problem with no machine idle time.
Comput. Ind. Eng.
Jacques Carlier, Fatma Hermès, Aziz Moukrim, Khaled Ghédira
2010 J jnl
Lower Bounds for the Minimal Sum Coloring Problem.
Electron. Notes Discret. Math.
Aziz Moukrim, K. Sghiouer, Corinne Lucet, Y. Li
2010 — conf
Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem.
IJCCI (ICEC)
Duc-Cuong Dang, Aziz Moukrim
2009 J jnl
A polynomial algorithm for recognizing the A
Discret. Math.
Aziz Moukrim, Eric Sanlaville
2009 J jnl
An MILP for scheduling problems in an FMS with one vehicle.
Eur. J. Oper. Res.
Anthony Caumond, Philippe Lacomme, Aziz Moukrim, Nikolay Tchernev
2009 — conf
Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time.
ICINCO-ICSO
Fatma Hermès, Jacques Carlier, Aziz Moukrim, Khaled Ghédira
2009 J jnl
The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm.
Discret. Appl. Math.
Jacques Carlier, Aziz Moukrim, Huang Xu
2008 — conf
A Memetic Algorithm for the Team Orienteering Problem.
EvoWorkshops
Hermann Bouly, Duc-Cuong Dang, Aziz Moukrim
2008 — conf
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
WEA
François Clautiaux, Antoine Jouglet, Aziz Moukrim
2008 J jnl
A new constraint programming approach for the orthogonal packing problem.
Comput. Oper. Res.
François Clautiaux, Antoine Jouglet, Jacques Carlier, Aziz Moukrim
2008 J jnl
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem.
Comput. Oper. Res.
Joseph El Hayek, Aziz Moukrim, Stéphane Nègre
2007 J jnl
A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett.
François Clautiaux, Jacques Carlier, Aziz Moukrim
2007 J jnl
A new exact method for the two-dimensional orthogonal packing problem.
Eur. J. Oper. Res.
François Clautiaux, Jacques Carlier, Aziz Moukrim
2007 J jnl
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Comput. Oper. Res.
Jacques Carlier, François Clautiaux, Aziz Moukrim
2006 J jnl
An exact method for graph coloring.
Comput. Oper. Res.
Corinne Lucet, Florence Mendes, Aziz Moukrim
2005 J jnl
Optimal preemptive scheduling on a fixed number of identical parallel machines.
Oper. Res. Lett.
Aziz Moukrim, Alain Quilliot
2005 J jnl
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders.
SIAM J. Discret. Math.
Marc Chardon, Aziz Moukrim
2004 J jnl
Heuristic and metaheuristic methods for computing graph treewidth.
RAIRO Oper. Res.
François Clautiaux, Aziz Moukrim, Stéphane Nègre, Jacques Carlier
2004 — conf
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem.
WEA
Corinne Lucet, Florence Mendes, Aziz Moukrim
2004 J jnl
Sensitivity analysis of tree scheduling on two machines with communication delays.
Parallel Comput.
Frédéric Guinand, Aziz Moukrim, Eric Sanlaville
2003 — conf
New Lower and Upper Bounds for Graph Treewidth.
WEA
François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
2003 J jnl
Parallel Machine Scheduling with Uncertain Communication Delays.
RAIRO Oper. Res.
Aziz Moukrim, Eric Sanlaville, Frédéric Guinand
2003 J jnl
Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders.
Discret. Appl. Math.
Aziz Moukrim
2001 A conf
Optimal Schedules of Coffman-Graham Algorithm for a New Order Class.
IPDPS
Marc Chardon, Aziz Moukrim
2000 J jnl
Upper bound on the number of processors for scheduling with interprocessor communication delays.
Math. Methods Oper. Res.
Aziz Moukrim
1999 J jnl
Non-preemptive Profile Scheduling and Quasi Interval Orders.
Electron. Notes Discret. Math.
Aziz Moukrim
1999 J jnl
On the minimum number of processors for scheduling problems with communicationdelays.
Ann. Oper. Res.
Aziz Moukrim
1999 J jnl
Optimal scheduling on parallel machines for a new order class.
Oper. Res. Lett.
Aziz Moukrim
1999 — conf
Scheduling with Communication Delays and On-Line Disturbances.
Euro-Par
Aziz Moukrim, Eric Sanlaville, Frédéric Guinand
1998 J jnl
Parallel Implementation of a Generalized Conjugate Gradient Algorithm.
Informatica
Jonas Koko, Aziz Moukrim
1998 — conf
Scheduling with Communication Delays and Data Routing in Message Passing Architectures.
IPPS/SPDP Workshops
Aziz Moukrim, Alain Quilliot