default search action
Rym M'Hallah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j45]Mehmet S. Erdogan, Rym M'Hallah
:
Synchronizing delivery and installation with vehicle sharing: A hybrid adaptive large neighborhood search. Comput. Ind. Eng. 185: 109676 (2023) - [j44]Z. A. M. S. Juman
A multi-vendor multi-buyer integrated production-inventory model with synchronised unequal-sized batch delivery. Int. J. Prod. Res. 61(2): 462-484 (2023) - 2022
- [j43]Sergey Polyakovskiy
A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem. Eur. J. Oper. Res. 299(1): 104-117 (2022) - [j42]Slim Belhaiza
On the impact of corruption on managers' and controllers' behavior. RAIRO Oper. Res. 56(1): 165-181 (2022) - [c15]Slim Belhaiza, Rym M'Hallah, Munirah Al-Qarni:
A Data-Driven Forecasting and Solution Approach for the Dial-A-Ride Problem with Time Windows. SSCI 2022: 101-110 - [c14]Yacine Laalaoui, Rym M'Hallah:
A problem-independent search heuristic for single machine scheduling with release dates and deadlines. SSCI 2022: 782-789 - 2021
- [j41]Intesar M. Al-Mudahka
Lower and upper bounds for the continuous single facility location problem in the presence of a forbidden region and travel barrier. RAIRO Oper. Res. 55(1): 141-165 (2021) - [j40]Ibtissem Ben Nejma
A beam search for the equality generalized symmetric traveling salesman problem. RAIRO Oper. Res. 55(5): 3021-3039 (2021) - 2020
- [j39]Rym M'Hallah
Optimal inventory policies for a two-dimensional stochastic inventory model: A numerical investigation. Comput. Oper. Res. 119: 104939 (2020) - [c13]Sergey Polyakovskiy
Just-in-time batch scheduling subject to batch size. GECCO 2020: 228-235
2010 – 2019
- 2019
- [j38]Rym M'Hallah
Cross-calibration of categorical variables: An evaluation of the genetic algorithm approach. Appl. Soft Comput. 74: 154-166 (2019) - [j37]Rym M'Hallah
A stochastic model for scheduling elective surgeries in a cyclic Master Surgical Schedule. Comput. Ind. Eng. 129: 156-168 (2019) - [j36]Slim Belhaiza
Three multi-start data-driven evolutionary heuristics for the vehicle routing problem with multiple time windows. J. Heuristics 25(3): 485-515 (2019) - 2018
- [j35]Sergey Polyakovskiy
A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates. Eur. J. Oper. Res. 266(3): 819-839 (2018) - [j34]Slim Belhaiza
On the Performance of Managers and Controllers: A Polymatrix Game Approach for the Manager-Controller-Board of Directors' Conflict. J. Optim. Theory Appl. 177(2): 584-602 (2018) - 2017
- [j33]Alex J. Ruiz-Torres
Makespan minimisation with sequence-dependent machine deterioration and maintenance events. Int. J. Prod. Res. 55(2): 462-479 (2017) - [j32]Mohamad Khattar Awad, Yousef Rafique, Rym M'Hallah
Energy-aware routing for software-defined networks with discrete link rates: A benders decomposition-based heuristic approach. Sustain. Comput. Informatics Syst. 13: 31-41 (2017) - [c12]Slim Belhaiza
A new Hybrid Genetic Variable Neighborhood search heuristic for the Vehicle Routing Problem with Multiple Time Windows. CEC 2017: 1319-1326 - [c11]Sergey Polyakovskiy
Just-in-time batch scheduling problem with two-dimensional bin packing constraints. GECCO 2017: 321-328 - [i2]Sergey Polyakovskiy, Rym M'Hallah:
A Hybrid Feasibility Constraints-Guided Search to the Two-Dimensional Bin Packing Problem with Due Dates. CoRR abs/1703.07244 (2017) - [i1]Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah:
Just-in-Time Batch Scheduling Problem with Two-dimensional Bin Packing Constraints. CoRR abs/1703.07290 (2017) - 2016
- [j31]Yacine Laalaoui, Rym M'Hallah
A binary multiple knapsack model for single machine scheduling with machine unavailability. Comput. Oper. Res. 72: 71-82 (2016) - [j30]Rym M'Hallah
Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry. Int. Trans. Oper. Res. 23(1-2): 321-353 (2016) - [j29]Rym M'Hallah
Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem. J. Sched. 19(2): 191-205 (2016) - [c10]Slim Belhaiza
A Pareto non-dominated solution approach for the vehicle routing problem with multiple time windows. CEC 2016: 3515-3524 - 2014
- [j28]Rym M'Hallah
Minimizing total earliness and tardiness on a permutation flow shop using VNS and MIP. Comput. Ind. Eng. 75: 142-156 (2014) - [j27]Rym M'Hallah
The planning and scheduling of operating rooms: A simulation approach. Comput. Ind. Eng. 78: 235-248 (2014) - [j26]Sergey Polyakovskiy
A multi-agent system for the weighted earliness tardiness parallel machine problem. Comput. Oper. Res. 44: 115-136 (2014) - 2013
- [j25]Rym M'Hallah
Packing unit spheres into the smallest sphere using VNS and NLP. Comput. Oper. Res. 40(2): 603-615 (2013) - 2012
- [j24]Mhand Hifi, Rym M'Hallah
Special issue on knapsack problems and applications. Comput. Oper. Res. 39(1): 1-2 (2012) - [j23]Rym M'Hallah
Packing Unit Spheres into a Cube Using VNS. Electron. Notes Discret. Math. 39: 201-208 (2012) - [c9]Sergey Polyakovskiy, Rym M'Hallah:
Minimizing Weighted Earliness and Tardiness on Parallel Machines Using a Multi-Agent System. OR 2012: 417-422 - 2011
- [j22]Talal Al-Khamis, Rym M'Hallah
A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity. Comput. Oper. Res. 38(12): 1747-1759 (2011) - [j21]Intesar M. Al-Mudahka, Mhand Hifi, Rym M'Hallah
Packing circles in the smallest circle: an adaptive hybrid algorithm. J. Oper. Res. Soc. 62(11): 1917-1930 (2011) - [c8]Sergey Polyakovsky
An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment. IEA/AIE (2) 2011: 226-236 - 2010
- [j20]Defu Zhang, Yongkai Liu, Rym M'Hallah
A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur. J. Oper. Res. 203(3): 550-558 (2010) - [j19]Hakim Akeb
Adaptive beam search lookahead algorithms for the circular packing problem. Int. Trans. Oper. Res. 17(5): 553-575 (2010)
2000 – 2009
- 2009
- [j18]Mhand Hifi, Rym M'Hallah
A Literature Review on Circle and Sphere Packing Problems: Models and Methodologies. Adv. Oper. Res. 2009: 150624:1-150624:22 (2009) - [j17]Mhand Hifi, Rym M'Hallah
Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem. Comput. Optim. Appl. 42(2): 303-326 (2009) - [j16]Hakim Akeb
A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5): 1513-1528 (2009) - [j15]Sergey Polyakovsky
An agent-based approach to the two-dimensional guillotine bin packing problem. Eur. J. Oper. Res. 192(3): 767-781 (2009) - [j14]Mhand Hifi, Rym M'Hallah
Beam search and non-linear programming tools for the circular packing problem. Int. J. Math. Oper. Res. 1(4): 476-503 (2009) - 2008
- [j13]Mhand Hifi, Rym M'Hallah
Adaptive and restarting techniques-based algorithms for circular packing problems. Comput. Optim. Appl. 39(1): 17-35 (2008) - [j12]Mhand Hifi, Rym M'Hallah
Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. INFORMS J. Comput. 20(2): 212-221 (2008) - [c7]Rym M'Hallah
Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem. IEA/AIE 2008: 397-407 - 2007
- [j11]Rym M'Hallah
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic. Comput. Oper. Res. 34(10): 3126-3142 (2007) - [j10]Rym M'Hallah
Minimizing the weighted number of tardy jobs on a single machine with release dates. Eur. J. Oper. Res. 176(2): 727-744 (2007) - [j9]Mhand Hifi, Rym M'Hallah
A dynamic adaptive local search algorithm for the circular packing problem. Eur. J. Oper. Res. 183(3): 1280-1294 (2007) - [c6]Ahlem Bouziri, Rym M'Hallah:
A Hybrid Genetic Algorithm for the Cut Order Planning Problem. IEA/AIE 2007: 454-463 - [c5]Sergey Polyakovsky, Rym M'Hallah:
An Agent-Based Approach to Knapsack Optimization Problems. IEA/AIE 2007: 1098-1107 - 2006
- [j8]Mhand Hifi, Rym M'Hallah
Strip generation algorithms for constrained two-dimensional two-staged cutting problems. Eur. J. Oper. Res. 172(2): 515-527 (2006) - 2005
- [j7]Rym M'Hallah
Minimizing the weighted number of tardy jobs on parallel processors. Eur. J. Oper. Res. 160(2): 471-484 (2005) - [j6]Mhand Hifi, Rym M'Hallah
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems. Oper. Res. 53(1): 140-150 (2005) - [c4]Lilia Rejeb
An Adaptive Approach for the Exploration-Exploitation Dilemma for Learning Agents. CEEMAS 2005: 316-325 - [c3]Lilia Rejeb
An Adaptive Approach for the Exploration-Exploitation Dilemma and Its Application to Economic Systems. LAMAS 2005: 165-176 - 2004
- [j5]Mhand Hifi, Rym M'Hallah
Approximate algorithms for constrained circular cutting problems. Comput. Oper. Res. 31(5): 675-694 (2004) - 2003
- [j4]Robert L. Bulfin Jr., Rym M'Hallah
Minimizing the weighted number of tardy jobs on a two-machine flow shop. Comput. Oper. Res. 30(12): 1887-1900 (2003) - [j3]Rym M'Hallah
Minimizing the weighted number of tardy jobs on a single machine. Eur. J. Oper. Res. 145(1): 45-56 (2003) - 2002
- [j2]Mhand Hifi, Rym M'Hallah:
A Best-Local Position Procedure-Based Heuristic for Two-Dimensional Layout Problems. Stud. Inform. Univ. 2(1): 33-56 (2002) - 2001
- [c2]Rym M'Hallah, Ahlem Bouziri, Walid Jilani:
Layout of Two Dimensional Irregular Shapes Using Genetic Algorithms. IEA/AIE 2001: 403-411
1990 – 1999
- 1998
- [c1]Boutheina Lassoued, Rym M'Hallah:
Daily Parking of Subway Vehicles. IEA/AIE (Vol. 2) 1998: 857-866 - 1997
- [j1]Mohamed Haouari, Rym M'Hallah:
Heuristic algorithms for the two-stage hybrid flowshop problem. Oper. Res. Lett. 21(1): 43-53 (1997)
Coauthor Index
aka: Sergey Polyakovsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: