default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMourad Boudhar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Nadia Babou
, Djamal Rebaine, Mourad Boudhar:
Solving the two-machine open shop problem with a single server with respect to the makespan. Ann. Oper. Res. 338(2): 857-877 (2024)- [j33]Kenza Alioui, Karim Amrouche, Mourad Boudhar:
Reentrant open shop scheduling problem with time lags and no-wait constraints. Comput. Oper. Res. 166: 106595 (2024) - [j32]Nadia Babou, Mourad Boudhar, Djamal Rebaine:
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times. Discret. Optim. 53: 100845 (2024) - [j31]Ali Khebouche, Mourad Boudhar:
Two-machine reentrant circular robotic cells with swap ability. Int. J. Comput. Sci. Math. 19(3): 221-231 (2024) - [j30]Amina Haned, Abida Kerdali, Mourad Boudhar:
Scheduling on identical machines with preemption and setup times. Int. J. Prod. Res. 62(1-2): 444-459 (2024) - [j29]Amin Mallek, Mourad Boudhar:
Scheduling on uniform machines with a conflict graph: complexity and resolution. Int. Trans. Oper. Res. 31(2): 863-888 (2024) - [j28]Nazim Sami, Karim Amrouche, Mourad Boudhar:
New efficient algorithms for the two-machine no-wait chain-reentrant shop problem. J. Comb. Optim. 47(5): 83 (2024) - [j27]Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
On the complexity of proportionate open shop and job shop problems. Optim. Lett. 18(1): 365-375 (2024) - 2023
- [j26]Djedjiga Ouiddir, Mourad Boudhar, Karima Bouibede-Hocine:
Bi-criteria two-machine flow shop scheduling problem involving sequence-dependent setup times and pieces multiplicity. Int. J. Math. Oper. Res. 24(4): 510-536 (2023) - [j25]Ali Khebouche, Mourad Boudhar, El-sedik Lamini:
Throughput optimisation in reentrant circular regular robot cells. Int. J. Math. Oper. Res. 26(1): 111-142 (2023) - [j24]Sarah Nouri, Mourad Boudhar:
Equitable colouring and scheduling on identical machines. Int. J. Math. Oper. Res. 26(3): 283-307 (2023) - [i1]Khaoula Bouakaz, Mourad Boudhar:
Compatibility graphs in scheduling on batch processing machines. CoRR abs/2309.02601 (2023) - 2022
- [j23]Abdennour Azerine, Mourad Boudhar, Djamal Rebaine:
A two-machine no-wait flow shop problem with two competing agents. J. Comb. Optim. 43(1): 168-199 (2022) - [j22]Amina Khedimi, Tarek Menouer, Christophe Cérin, Mourad Boudhar:
A cloud weather forecasting service and its relationship with anomaly detection. Serv. Oriented Comput. Appl. 16(3): 191-208 (2022) - 2021
- [j21]Nadia Babou, Djamal Rebaine, Mourad Boudhar:
Two-machine open shop problem with a single server and set-up time considerations. Theor. Comput. Sci. 867: 13-29 (2021)
2010 – 2019
- 2019
- [j20]Nadjat Meziani, Ammar Oulamara, Mourad Boudhar:
Two-machine flowshop scheduling problem with coupled-operations. Ann. Oper. Res. 275(2): 511-530 (2019) - [j19]Amin Mallek, Mohamed Bendraouche, Mourad Boudhar:
Scheduling identical jobs on uniform machines with a conflict graph. Comput. Oper. Res. 111: 357-366 (2019) - [j18]Amine Mohabeddine, Mourad Boudhar:
New results in two identical machines scheduling with agreement graphs. Theor. Comput. Sci. 779: 37-46 (2019) - [j17]Nour El Houda Tellache, Mourad Boudhar, Farouk Yalaoui:
Two-machine open shop problem with agreement graph. Theor. Comput. Sci. 796: 154-168 (2019) - 2018
- [j16]Nour El Houda Tellache, Mourad Boudhar:
Flow shop scheduling problem with conflict graphs. Ann. Oper. Res. 261(1-2): 339-363 (2018) - 2017
- [j15]Nour El Houda Tellache, Mourad Boudhar:
Open shop scheduling problems with conflict graphs. Discret. Appl. Math. 227: 103-120 (2017) - [j14]Karim Amrouche, Mourad Boudhar, Mohamed Bendraouche, Farouk Yalaoui:
Chain-reentrant shop with an exact time lag: new results. Int. J. Prod. Res. 55(1): 285-295 (2017) - [j13]Wafaa Labbi, Mourad Boudhar, Ammar Oulamara:
Scheduling two identical parallel machines with preparation constraints. Int. J. Prod. Res. 55(6): 1531-1548 (2017) - [j12]Nour El Houda Tellache, Mourad Boudhar:
Two-machine flow shop problem with unit-time operations and conflict graph. Int. J. Prod. Res. 55(6): 1664-1679 (2017) - 2016
- [j11]Abdelhakim AitZai, Brahim Benmedjdoub, Mourad Boudhar:
Branch-and-bound and PSO algorithms for no-wait job shop scheduling. J. Intell. Manuf. 27(3): 679-688 (2016) - [j10]Karim Amrouche, Mourad Boudhar:
Two machines flow shop with reentrance and exact time lag. RAIRO Oper. Res. 50(2): 223-232 (2016) - 2015
- [j9]Mohamed Bendraouche, Mourad Boudhar, Ammar Oulamara:
Scheduling: Agreement graph vs resource constraints. Eur. J. Oper. Res. 240(2): 355-360 (2015) - 2012
- [j8]Amina Haned, Ameur Soukhal, Mourad Boudhar, Nguyen Huynh Tuong:
Scheduling on parallel machines with preemption and transportation delays. Comput. Oper. Res. 39(2): 374-381 (2012) - [j7]Mohamed Bendraouche, Mourad Boudhar:
Scheduling jobs on identical machines with agreement graph. Comput. Oper. Res. 39(2): 382-390 (2012) - 2011
- [j6]Mourad Boudhar, Nacira Chikhi:
Two machine Flow shop with transportation time. Stud. Inform. Univ. 9(2): 50-75 (2011) - 2010
- [j5]Mourad Boudhar, Nadjat Meziani:
Two-stage hybrid flow shop with recirculation. Int. Trans. Oper. Res. 17(2): 239-255 (2010)
2000 – 2009
- 2009
- [j4]Mourad Boudhar, Amina Haned:
Preemptive scheduling in the presence of transportation times. Comput. Oper. Res. 36(8): 2387-2393 (2009) - 2005
- [j3]Mourad Boudhar:
Scheduling on a Batch Processing Machine with Split Compatibility Graphs. J. Math. Model. Algorithms 4(4): 391-407 (2005) - 2003
- [j2]Mourad Boudhar:
Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs. J. Math. Model. Algorithms 2(1): 17-35 (2003) - [j1]Mourad Boudhar:
Scheduling a batch processing machine with bipartite compatibility graphs. Math. Methods Oper. Res. 57(3): 513-527 (2003)
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 2025-03-04 22:17 CET 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:
