Automated Author ProfileAzab, Ahmed
Azab, Ahmed
Current S-Index
Sum of Dataset Indices for all datasets
Average Dataset Index per Dataset
Average Dataset Index per dataset
Total Datasets
Total datasets for this author
Average FAIR Score
Average FAIR Score per dataset
Total Citations
Total citations to the author's datasets
Total Mentions
Total mentions of the author's datasets
S-Index Interpretation
The S-Index (Sharing Index) is a comprehensive metric that represents the cumulative impact of all your datasets. It is calculated as the sum of Dataset Index scores across all your claimed datasets.
What it means:
- A higher S-index indicates greater overall impact of your datasets relative to typical datasets in their fields of research
- The S-Index grows as you add more datasets or as existing datasets gain more citations and mentions
- It provides a single number to track your research data impact over time
Current S-Index: 3.4 (sum of 2 datasets Dataset Index scores)
More information here.
S-Index Over Time
Cumulative Citations Over Time
Cumulative Mentions Over Time
Datasets
This Data set is used from different published papers in container/block relocation problems. The used instances are further processed to fit the research topic of "The Block Relocation Problem with Appointment Scheduling (BRPAS)". In the BRPAS, we introduce a new optimization problem that studies the container relocation in the container terminal under the appointment scheduling for container pickup operations. Since we are introducing a new problem, which is different from the existing work in the literature, we used some data sets from existing published work and modified them to fit our approach. However, the developed instances still can be comparable to the existing original instances. the uploaded files are named with authors' names of the original data set.
Authors
- Azab, Ahmed
This Data set is used from different published papers in container/block relocation problems. The used instances are further processed to fit the research topic of "The Block Relocation Problem with Appointment Scheduling (BRPAS)". In the BRPAS, we introduce a new optimization problem that studies the container relocation in the container terminal under the appointment scheduling for container pickup operations. Since we are introducing a new problem, which is different from the existing work in the literature, we used some data sets from existing published work and modified them to fit our approach. However, the developed instances still can be comparable to the existing original instances. the uploaded files are named with authors' names of the original data set.
Authors
- Azab, Ahmed