default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRachid Benmansour
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Abdelhak Elidrissi
, Rachid Benmansour, Nicolas Zufferey, Mohammed Benbrahim, David Duvivier:
Minimization of maximum lateness on parallel machines with a single server and job release dates. 4OR 22(3): 351-385 (2024)- [j27]Issam Krimi, Rachid Benmansour:
Self-adaptive General Variable Neighborhood Search algorithm for parallel machine scheduling with unrelated servers. Comput. Oper. Res. 163: 106480 (2024) - [j26]Abdelhak Elidrissi, Rachid Benmansour, Keramat Hasani, Frank Werner:
Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations. Comput. Oper. Res. 167: 106638 (2024) - [j25]Mohammed Bazirha, Abdeslam Kadrani, Rachid Benmansour:
Pareto and decomposition based approaches for the multi-objective home health care routing and scheduling problem with lunch breaks. Eng. Appl. Artif. Intell. 128: 107502 (2024) - [c18]Oualid Benbrik, Rachid Benmansour, Abdelhak Elidrissi, Angelo Sifaleras:
Advanced Algorithms for the Reclaimer Scheduling Problem with Sequence-Dependent Setup Times and Availability Constraints. MIC (1) 2024: 291-308 - 2023
- [j24]Mohammed Bazirha, Abdeslam Kadrani, Rachid Benmansour:
Stochastic home health care routing and scheduling problem with multiple synchronized services. Ann. Oper. Res. 320(2): 573-601 (2023) - [j23]Mohammed Bazirha, Rachid Benmansour, Abdeslam Kadrani:
An efficient two-phase heuristic for the home care routing and scheduling problem. Comput. Ind. Eng. 181: 109329 (2023) - [j22]Rachid Benmansour, Oliver Braun:
On the minimum number of resources for a perfect schedule. Central Eur. J. Oper. Res. 31(1): 191-204 (2023) - [j21]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2113-2131 (2023) - [j20]Issam Krimi, Rachid Benmansour, Raca Todosijevic, Nenad Mladenovic, Mustapha Ratli:
Correction to: A no-delay single machine scheduling problem to minimize total weighted early and late work. Optim. Lett. 17(9): 2133-2134 (2023) - [j19]Rachid Benmansour, Raca Todosijevic, Saïd Hanafi:
Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optim. Lett. 17(9): 2169-2184 (2023) - [j18]Abdelhak Elidrissi, Rachid Benmansour, Angelo Sifaleras:
General variable neighborhood search for the parallel machine scheduling problem with two common servers. Optim. Lett. 17(9): 2201-2231 (2023) - [c17]Fouad Medouar, Abdelhak Elidrissi, Rachid Benmansour, Jatinder N. D. Gupta:
No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with a Single Server and Separable Setup Times to Minimize Total Tardiness. CoDIT 2023: 626-631 - [i1]Abdelhak Elidrissi, Rachid Benmansour, Keramat Hasani, Frank Werner:
Scheduling on parallel machines with a common server in charge of loading and unloading operations. CoRR abs/2306.16669 (2023) - 2022
- [j17]Nenad Mladenovic, Panos M. Pardalos, Angelo Sifaleras, Rachid Benmansour:
Preface to the special issue on variable neighborhood search. Optim. Lett. 16(1): 1-4 (2022) - [j16]Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier:
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. J. Sched. 25(1): 89-105 (2022) - [c16]Rachid Benmansour:
A VNS-Based Heuristic for the Minimum Number of Resources Under a Perfect Schedule. ICVNS 2022: 14-26 - 2021
- [j15]Abdelhak Elidrissi, Rachid Benmansour, Mohammed Benbrahim, David Duvivier:
Mathematical formulations for the parallel machine scheduling problem with a single server. Int. J. Prod. Res. 59(20): 6166-6184 (2021) - [c15]Rachid Benmansour, Angelo Sifaleras:
Scheduling in Parallel Machines with Two Servers: The Restrictive Case. ICVNS 2021: 71-82 - 2020
- [j14]Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi:
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. Comput. Optim. Appl. 75(1): 291-320 (2020) - [j13]Issam Krimi, Raca Todosijevic, Rachid Benmansour, Mustapha Ratli, Abdessamad Ait El Cadi, Afaf Aloullal:
Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints. J. Glob. Optim. 78(2): 349-373 (2020) - [c14]Mohammed Bazirha, Abdeslam Kadrani, Rachid Benmansour:
Scheduling Optimization of the Home Health Care Problem with Stochastic Travel and Care Times. GOL 2020: 1-8 - [e1]Rachid Benmansour, Angelo Sifaleras, Nenad Mladenovic:
Variable Neighborhood Search - 7th International Conference, ICVNS 2019, Rabat, Morocco, October 3-5, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12010, Springer 2020, ISBN 978-3-030-44931-5 [contents]
2010 – 2019
- 2019
- [j12]Marco Andreacchio, Abdelghani Bekrar, Rachid Benmansour, Damien Trentesaux:
Assessing cyber-physical systems to balance maintenance replacement policies and optimise long-run average costs for aircraft assets. IET Cyper-Phys. Syst.: Theory & Appl. 4(2): 148-155 (2019) - [j11]Hanane Krim, Rachid Benmansour, David Duvivier, Abdelhakim Artiba:
A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance. RAIRO Oper. Res. 53(1): 289-302 (2019) - [j10]Issam Krimi, Rachid Benmansour, Saïd Hanafi, Nizar El Hachemi:
Two-machine flow shop with synchronized periodic maintenance. RAIRO Oper. Res. 53(1): 351-365 (2019) - [j9]Rachid Benmansour, Oliver Braun, Saïd Hanafi:
The single-processor scheduling problem with time restrictions: complexity and related problems. J. Sched. 22(4): 465-471 (2019) - [c13]Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt:
Optimization of Maintenance Planning and Routing Problems. ICVNS 2019: 95-111 - [c12]Abdelhak Elidrissi, Mohammed Benbrahim, Rachid Benmansour, David Duvivier:
Variable Neighborhood Search for Identical Parallel Machine Scheduling Problem with a Single Server. ICVNS 2019: 112-125 - [c11]Mohammed Bazirha, Abdeslam Kadrani, Rachid Benmansour:
Daily Scheduling and Routing of Home Health Care with Multiple Availability Periods of Patients. ICVNS 2019: 178-193 - 2018
- [j8]Safa Khalouli, Rachid Benmansour, Saïd Hanafi:
Ant colony optimisation combined with variable neighbourhood search for scheduling preventive railway maintenance activities. Int. J. Intell. Eng. Informatics 6(1/2): 78-98 (2018) - [c10]Hanane Krim, Rachid Benmansour, David Duvivier:
On the single machine scheduling problem with sequence-dependent setup times and periodic maintenance. CoDIT 2018: 374-378 - [c9]Rachid Benmansour, Oliver Braun, Saïd Hanafi, Nenad Mladenovic:
Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions. ICVNS 2018: 202-215 - [c8]Issam Krimi, Afaf Aloullal, Rachid Benmansour, Abdessamad Ait El Cadi, Laurent Deshayes, David Duvivier:
A Variable Neighborhood Descent Heuristic for the Multi-quay Berth Allocation and Crane Assignment Problem Under Availability Constraints. ICVNS 2018: 232-242 - 2017
- [j7]Rita Macedo, Rachid Benmansour, Abdelhakim Artiba, Nenad Mladenovic, Dragan Urosevic:
Scheduling preventive railway maintenance activities with resource constraints. Electron. Notes Discret. Math. 58: 215-222 (2017) - [j6]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Saïd Hanafi:
New complexity results on scheduling problem in a robotic cell. RAIRO Oper. Res. 51(3): 749-762 (2017) - 2016
- [j5]Raca Todosijevic, Rachid Benmansour, Saïd Hanafi, Nenad Mladenovic, Abdelhakim Artiba:
Nested general variable neighborhood search for the periodic maintenance problem. Eur. J. Oper. Res. 252(2): 385-396 (2016) - [c7]Safa Khalouli, Rachid Benmansour, Saïd Hanafi:
An ant colony algorithm based on opportunities for scheduling the preventive railway maintenance. CoDIT 2016: 594-599 - [c6]Marco Andreacchio, Abdelghani Bekrar, Rachid Benmansour, Damien Trentesaux:
Balancing preventive and corrective maintenance of aircraft assets: A cyber-physical systems approach. INDIN 2016: 500-503 - 2015
- [j4]Nacira Chikhi, Moncef Abbas, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi:
A two-stage flow shop scheduling problem with transportation considerations. 4OR 13(4): 381-402 (2015) - [j3]Bouthaina Dammak, Mouna Baklouti, Rachid Benmansour, Smaïl Niar, Mohamed Abid:
Framework for a Selection of Custom Instructions for Ht-MPSoC in Area-performance Aware Manner. IEEE Embed. Syst. Lett. 7(4): 105-108 (2015) - [j2]Bouthaina Dammak, Mouna Baklouti, Rachid Benmansour, Smaïl Niar, Mohamed Abid:
Hardware resource utilization optimization in FPGA-based Heterogeneous MPSoC architectures. Microprocess. Microsystems 39(8): 1108-1118 (2015) - [c5]Braham Lotfi Mediouni, Smaïl Niar, Rachid Benmansour, Karima Benatchba, Mouloud Koudil:
A bi-objective heuristic for heterogeneous MPSoC design space exploration. IDT 2015: 90-95 - 2014
- [j1]Rachid Benmansour, Hamid Allaoui, Abdelhakim Artiba, Saïd Hanafi:
Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance. Comput. Oper. Res. 47: 106-113 (2014) - [c4]Rachid Benmansour, Oliver Braun, Abdelhakim Artiba:
On the single-processor scheduling problem with time restrictions. CoDIT 2014: 242-245 - [c3]Nacira Chikhi, Rachid Benmansour, Abdelghani Bekrar, Saïd Hanafi, Moncef Abbas:
A case study of a two-stage flow shop with dedicated machines and a single robot. CoDIT 2014: 246-250 - [c2]Bouthaina Damak, Rachid Benmansour, Mouna Baklouti, Smaïl Niar, Mohamed Abid:
Design Space Exploration for Customized Asymmetric Heterogeneous MPSoC. DSD 2014: 50-57 - [c1]Bouthaina Damak, Rachid Benmansour, Smaïl Niar, Mouna Baklouti, Mohamed Abid:
A mixed integer linear programming approach for design space exploration in FPGA-based MPSoC. FPL 2014: 1-4
Coauthor Index
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-09-10 01:16 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:
