Aziz Moukrim

Orcid: 0000-0003-0151-6327

According to our database1, Aziz Moukrim authored at least 73 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Effective adaptive large neighborhood search for a firefighters timetabling problem.
J. Heuristics, December, 2023

GRASP-ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows.
Int. Trans. Oper. Res., 2023

Scheduling in an Emergency Department, Linear Formulation and Heuristic Approach.
Proceedings of the 9th International Conference on Control, 2023

2022
Surgery planning for elective patients: A dedicated heuristic and an effective ALNS.
Eng. Appl. Artif. Intell., 2022

Using decomposition-based multi-objective algorithm to solve Selective Pickup and Delivery Problems with Time Windows.
Comput. Oper. Res., 2022

An Elitist Non-dominated Heuristic Resolution for the Dynamic Asset Protection Problem.
Proceedings of the Artificial Evolution, 2022

2021
Polynomial algorithms for some scheduling problems with one nonrenewable resource.
RAIRO Oper. Res., 2021

The student scheduling problem at Université de Technologie de Compiègne.
Expert Syst. Appl., 2021

Exact method for the two-machine flow-shop problem with time delays.
Ann. Oper. Res., 2021

2020
Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows.
Comput. Oper. Res., 2020

A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit.
Ann. Oper. Res., 2020

2019
A variable space search heuristic for the Capacitated Team Orienteering Problem.
J. Heuristics, 2019

Integration of routing into a resource-constrained project scheduling problem.
EURO J. Comput. Optim., 2019

The clustered team orienteering problem.
Comput. Oper. Res., 2019

Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems.
Comput. Oper. Res., 2019

2018
Supply chain optimisation with both production and transportation integration: multiple vehicles for a single perishable product.
Int. J. Prod. Res., 2018

Lower bounds for the Event Scheduling Problem with Consumption and Production of Resources.
Discret. Appl. Math., 2018

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem.
Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, 2018

2017
A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution.
Eng. Appl. Artif. Intell., 2017

Hybrid Heuristic for the Clustered Orienteering Problem.
Proceedings of the Computational Logistics - 8th International Conference, 2017

A branch-and-bound algorithm for the two-machine flow-shop problem with time delays.
Proceedings of the 4th International Conference on Control, 2017

2016
Heuristic solutions for the vehicle routing problem with time windows and synchronized visits.
Optim. Lett., 2016

Solving the team orienteering problem with cutting planes.
Comput. Oper. Res., 2016

Lower Bounds for the Two-Machine Flow Shop Problem with Time Delays.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

2015
An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration.
Eur. J. Oper. Res., 2015

Preprocessing and an improved MIP model for examination timetabling.
Ann. Oper. Res., 2015

2014
A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays.
RAIRO Oper. Res., 2014

New Lower Bounds on the Number of Vehicles for the Vehicle Routing Problem with Time Windows.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Branch and price with constraint propagation for Resource Constrained Project Scheduling Problem.
Proceedings of the International Conference on Control, 2014

2013
A New Graph-Theoretical Model for the Guillotine-Cutting Problem.
INFORMS J. Comput., 2013

A Memetic Algorithm for staff scheduling problem in airport security service.
Expert Syst. Appl., 2013

An effective PSO-inspired algorithm for the team orienteering problem.
Eur. J. Oper. Res., 2013

An Analysis Framework for Examination Timetabling.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

A Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows and Synchronization Constraints.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Branch and Price for Preemptive and Non Preemptive RCPSP Based on Interval Orders on Precedence Graphs.
Proceedings of the Recent Advances in Computational Optimization, 2013

Branch and Price for Preemptive Resource Constrained Project Scheduling Problem Based on Interval Orders in Precedence Graphs.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Memetic Algorithm with an Efficient Split Procedure for the Team Orienteering Problem with Time Windows.
Proceedings of the Artificial Evolution, 2013

2012
Subgraph extraction and metaheuristics for the maximum clique problem.
J. Heuristics, 2012

2011
A PSO-Based Memetic Algorithm for the Team Orienteering Problem.
Proceedings of the Applications of Evolutionary Computation, 2011

2010
An optimization-based heuristic for the robotic cell problem.
Eur. J. Oper. Res., 2010

Lower Bounds for the Minimal Sum Coloring Problem.
Electron. Notes Discret. Math., 2010

Exact Method for Robotic Cell Problem.
Electron. Notes Discret. Math., 2010

Exact resolution of the one-machine sequencing problem with no machine idle time.
Comput. Ind. Eng., 2010

A memetic algorithm for the team orienteering problem.
4OR, 2010

Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem.
Proceedings of the ICEC 2010 - Proceedings of the International Conference on Evolutionary Computation, [part of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24, 2010

2009
An MILP for scheduling problems in an FMS with one vehicle.
Eur. J. Oper. Res., 2009

A polynomial algorithm for recognizing the A<sub>m</sub>-order class.
Discret. Math., 2009

The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm.
Discret. Appl. Math., 2009

Minimizing the Makespan in Two-machine Job Shop Scheduling Problems with no Machine Idle-time.
Proceedings of the ICINCO 2009, 2009

2008
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem.
Comput. Oper. Res., 2008

A new constraint programming approach for the orthogonal packing problem.
Comput. Oper. Res., 2008

A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett., 2007

A new exact method for the two-dimensional orthogonal packing problem.
Eur. J. Oper. Res., 2007

New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Comput. Oper. Res., 2007

2006
An exact method for graph coloring.
Comput. Oper. Res., 2006

2005
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders.
SIAM J. Discret. Math., 2005

Optimal preemptive scheduling on a fixed number of identical parallel machines.
Oper. Res. Lett., 2005

2004
Heuristic and metaheuristic methods for computing graph treewidth.
RAIRO Oper. Res., 2004

Sensitivity analysis of tree scheduling on two machines with communication delays.
Parallel Comput., 2004

Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Parallel Machine Scheduling with Uncertain Communication Delays.
RAIRO Oper. Res., 2003

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

New Lower and Upper Bounds for Graph Treewidth.
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

2001
Optimal Schedules of Coffman-Graham Algorithm for a New Order Class.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

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

1999
Optimal scheduling on parallel machines for a new order class.
Oper. Res. Lett., 1999

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

On the minimum number of processors for scheduling problems with communicationdelays.
Ann. Oper. Res., 1999

Scheduling with Communication Delays and On-Line Disturbances.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Parallel Implementation of a Generalized Conjugate Gradient Algorithm.
Informatica, 1998

Scheduling with Communication Delays and Data Routing in Message Passing Architectures.
Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998


  Loading...