Rym M'Hallah

Orcid: 0000-0001-6775-7276

According to our database1, Rym M'Hallah authored at least 60 papers between 1997 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Synchronizing delivery and installation with vehicle sharing: A hybrid adaptive large neighborhood search.
Comput. Ind. Eng., November, 2023

A multi-vendor multi-buyer integrated production-inventory model with synchronised unequal-sized batch delivery.
Int. J. Prod. Res., January, 2023

2022
On the impact of corruption on managers' and controllers' behavior.
RAIRO Oper. Res., 2022

A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem.
Eur. J. Oper. Res., 2022

A problem-independent search heuristic for single machine scheduling with release dates and deadlines.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

A Data-Driven Forecasting and Solution Approach for the Dial-A-Ride Problem with Time Windows.
Proceedings of the IEEE Symposium Series on Computational Intelligence, 2022

2021
A beam search for the equality generalized symmetric traveling salesman problem.
RAIRO Oper. Res., 2021

Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier.
RAIRO Oper. Res., 2021

2020
Optimal inventory policies for a two-dimensional stochastic inventory model: A numerical investigation.
Comput. Oper. Res., 2020

Just-in-time batch scheduling subject to batch size.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows.
J. Heuristics, 2019

A stochastic model for scheduling elective surgeries in a cyclic Master Surgical Schedule.
Comput. Ind. Eng., 2019

Cross-calibration of categorical variables: An evaluation of the genetic algorithm approach.
Appl. Soft Comput., 2019

2018
On the Performance of Managers and Controllers: A Polymatrix Game Approach for the Manager-Controller-Board of Directors' Conflict.
J. Optim. Theory Appl., 2018

A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates.
Eur. J. Oper. Res., 2018

2017
Energy-aware routing for software-defined networks with discrete link rates: A benders decomposition-<i>based</i> heuristic approach.
Sustain. Comput. Informatics Syst., 2017

Makespan minimisation with sequence-dependent machine deterioration and maintenance events.
Int. J. Prod. Res., 2017

Just-in-time batch scheduling problem with two-dimensional bin packing constraints.
Proceedings of the Genetic and Evolutionary Computation Conference, 2017

A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows.
Proceedings of the 2017 IEEE Congress on Evolutionary Computation, 2017

2016
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem.
J. Sched., 2016

Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry.
Int. Trans. Oper. Res., 2016

A binary multiple knapsack model for single machine scheduling with machine unavailability.
Comput. Oper. Res., 2016

A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2014
A multi-agent system for the weighted earliness tardiness parallel machine problem.
Comput. Oper. Res., 2014

The planning and scheduling of operating rooms: A simulation approach.
Comput. Ind. Eng., 2014

Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP.
Comput. Ind. Eng., 2014

2013
Packing unit spheres into the smallest sphere using VNS and NLP.
Comput. Oper. Res., 2013

2012
Packing Unit Spheres into a Cube Using VNS.
Electron. Notes Discret. Math., 2012

Special issue on knapsack problems and applications.
Comput. Oper. Res., 2012

Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System.
Proceedings of the Operations Research Proceedings 2012, 2012

2011
Packing circles in the smallest circle: an adaptive hybrid algorithm.
J. Oper. Res. Soc., 2011

A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity.
Comput. Oper. Res., 2011

An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment.
Proceedings of the Modern Approaches in Applied Intelligence, 2011

2010
Adaptive beam search lookahead algorithms for the circular packing problem.
Int. Trans. Oper. Res., 2010

A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems.
Eur. J. Oper. Res., 2010

2009
Beam search and non-linear programming tools for the circular packing problem.
Int. J. Math. Oper. Res., 2009

An agent-based approach to the two-dimensional guillotine bin packing problem.
Eur. J. Oper. Res., 2009

A beam search algorithm for the circular packing problem.
Comput. Oper. Res., 2009

Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem.
Comput. Optim. Appl., 2009

A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies.
Adv. Oper. Res., 2009

2008
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem.
INFORMS J. Comput., 2008

Adaptive and restarting techniques-based algorithms for circular packing problems.
Comput. Optim. Appl., 2008

Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem.
Proceedings of the New Frontiers in Applied Artificial Intelligence, 2008

2007
Minimizing the weighted number of tardy jobs on a single machine with release dates.
Eur. J. Oper. Res., 2007

A dynamic adaptive local search algorithm for the circular packing problem.
Eur. J. Oper. Res., 2007

Minimizing total earliness and tardiness on a single machine using a hybrid heuristic.
Comput. Oper. Res., 2007

An Agent-Based Approach to Knapsack Optimization Problems.
Proceedings of the New Trends in Applied Artificial Intelligence, 2007

A Hybrid Genetic Algorithm for the Cut Order Planning Problem.
Proceedings of the New Trends in Applied Artificial Intelligence, 2007

2006
Strip generation algorithms for constrained two-dimensional two-staged cutting problems.
Eur. J. Oper. Res., 2006

2005
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems.
Oper. Res., 2005

Minimizing the weighted number of tardy jobs on parallel processors.
Eur. J. Oper. Res., 2005

An Adaptive Approach for the Exploration-Exploitation Dilemma and Its Application to Economic Systems.
Proceedings of the Learning and Adaption in Multi-Agent Systems, 2005

An Adaptive Approach for the Exploration-Exploitation Dilemma for Learning Agents.
Proceedings of the Multi-Agent Systems and Applications IV, 2005

2004
Approximate algorithms for constrained circular cutting problems.
Comput. Oper. Res., 2004

2003
Minimizing the weighted number of tardy jobs on a single machine.
Eur. J. Oper. Res., 2003

Minimizing the weighted number of tardy jobs on a two-machine flow shop.
Comput. Oper. Res., 2003

2002
A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems.
Stud. Inform. Univ., 2002

2001
Layout of Two Dimensional Irregular Shapes Using Genetic Algorithms.
Proceedings of the Engineering of Intelligent Systems, 2001

1998
Daily Parking of Subway Vehicles.
Proceedings of the Tasks and Methods in Applied Artificial Intelligence, 1998

1997
Heuristic algorithms for the two-stage hybrid flowshop problem.
Oper. Res. Lett., 1997


  Loading...