Aziz Moukrim
Orcid: 0000-0003-0151-6327
According to our database1,
Aziz Moukrim
authored at least 73 papers
between 1998 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
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
Proceedings of the 9th International Conference on Control, 2023
2022
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
RAIRO Oper. Res., 2021
Expert Syst. Appl., 2021
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
J. Heuristics, 2019
EURO J. Comput. Optim., 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
Proceedings of the Computational Logistics - 8th International Conference, 2017
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
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
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
INFORMS J. Comput., 2013
Expert Syst. Appl., 2013
Eur. J. Oper. Res., 2013
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
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
J. Heuristics, 2012
2011
Proceedings of the Applications of Evolutionary Computation, 2011
2010
Eur. J. Oper. Res., 2010
Electron. Notes Discret. Math., 2010
Comput. Ind. Eng., 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
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
Comput. Oper. Res., 2008
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
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
2005
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders.
SIAM J. Discret. Math., 2005
Oper. Res. Lett., 2005
2004
RAIRO Oper. Res., 2004
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
RAIRO Oper. Res., 2003
Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders.
Discret. Appl. Math., 2003
Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003
2001
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
Oper. Res. Lett., 1999
Electron. Notes Discret. Math., 1999
On the minimum number of processors for scheduling problems with communicationdelays.
Ann. Oper. Res., 1999
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999
1998
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