default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammed M. S. El-Kholany
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
Journal Articles
- 2025
[j2]Mohammed M. S. El-Kholany, Martin Gebser, Konstantin Schekotihin:
Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling. Log. Methods Comput. Sci. 21(3) (2025)- 2022
- [j1]Mohammed M. S. El-Kholany
, Martin Gebser, Konstantin Schekotihin:
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling. Theory Pract. Log. Program. 22(4): 623-639 (2022)
Conference and Workshop Papers
- 2024
- [c8]Ramsha Ali, Shahzad Qaiser, Mohammed M. S. El-Kholany, Peyman Eftekhari, Martin Gebser, Stephan Leitner, Gerhard Friedrich:
A Greedy Search Based Ant Colony Optimization Algorithm for Large-Scale Semiconductor Production. SIMULTECH 2024: 138-149 - 2023
- [c7]Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser:
Hybrid ASP-Based Multi-objective Scheduling of Semiconductor Manufacturing Processes. JELIA 2023: 243-252 - [c6]Ramsha Ali, Mohammed M. S. El-Kholany, Martin Gebser:
Flexible Job-shop Scheduling for Semiconductor Manufacturing with Hybrid Answer Set Programming (Application Paper). PADL 2023: 85-95 - 2022
- [c5]Mohammed M. S. El-Kholany:
Decomposition Methods for Solving Scheduling Problem Using Answer Set Programming. IJCAI 2022: 5849-5850 - [c4]Mohammed M. S. El-Kholany, Konstantin Schekotihin, Martin Gebser:
Decomposition-Based Job-Shop Scheduling with Constrained Clustering. PADL 2022: 165-180 - [c3]Mohammed M. S. El-Kholany:
Decomposition Strategies for Solving Scheduling Problems in Industrial Applications. ICLP Technical Communications / Doctoral Consortium 2022: 236-242 - 2021
- [c2]Giulia Francescutto, Konstantin Schekotihin, Mohammed M. S. El-Kholany:
Solving a Multi-resource Partial-Ordering Flexible Variant of the Job-Shop Scheduling Problem with Hybrid ASP. JELIA 2021: 313-328 - 2016
- [c1]Mohammed M. S. El-Kholany, Hisham M. Abdelsalam:
A Binary Cuckoo Search Algorithm for Solving Project Portfolio Problem with Synergy Considerations. ICORES 2016: 130-136
Informal and Other Publications
- 2023
- [i3]Mohammed M. S. El-Kholany, Ramsha Ali, Martin Gebser:
Hybrid ASP-based multi-objective scheduling of semiconductor manufacturing processes (Extended version). CoRR abs/2307.14799 (2023) - 2022
- [i2]Mohammed M. S. El-Kholany, Martin Gebser, Konstantin Schekotihin:
Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling. CoRR abs/2205.07537 (2022) - 2021
- [i1]Giulia Francescutto, Konstantin Schekotihin, Mohammed M. S. El-Kholany:
Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP. CoRR abs/2101.10162 (2021)
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-09-02 01:35 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
