The stage shop scheduling problem: lower bound and metaheuristic Article Swipe
Mohammad Mahdi Nasiri
,
Mahdi Hamid
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.24200/sci.2018.5199.1146
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.24200/sci.2018.5199.1146
Remarkable efforts are made to develop the job shop scheduling problem up to now. As a novel generalization, the stage shop can be defined as an environment, in which each job is composed of some stages and each stage may include one operation or more. A stage can be defined a subset of operations of a job, such that these operations can be done in any arbitrary relative order while the stages should be processed in a predetermined order. In other words, the operations of a stage cannot be initiated until all operations of the prior stage are completed. In this paper, an innovative lower bound based on solving the preemptive open shop (using a linear programming model in polynomial time) is devised for the makespan in a stage shop problem. In addition, three metaheuristics, including firefly, harmony search and water wave optimization algorithms are applied to the problem. The results of the algorithms are compared with each other, the proposed lower bound, and a commercial solver.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.24200/sci.2018.5199.1146
- http://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdf
- OA Status
- diamond
- Cited By
- 8
- References
- 35
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2913074586
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2913074586Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.24200/sci.2018.5199.1146Digital Object Identifier
- Title
-
The stage shop scheduling problem: lower bound and metaheuristicWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-11-03Full publication date if available
- Authors
-
Mohammad Mahdi Nasiri, Mahdi HamidList of authors in order
- Landing page
-
https://doi.org/10.24200/sci.2018.5199.1146Publisher landing page
- PDF URL
-
https://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdfDirect OA link when available
- Concepts
-
Job shop scheduling, Metaheuristic, Mathematical optimization, Computer science, Solver, Harmony search, Firefly algorithm, Job shop, Flow shop scheduling, Scheduling (production processes), Upper and lower bounds, Mathematics, Operating system, Schedule, Particle swarm optimization, Mathematical analysisTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
8Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 4, 2023: 2, 2022: 2Per-year citation counts (last 5 years)
- References (count)
-
35Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2913074586 |
|---|---|
| doi | https://doi.org/10.24200/sci.2018.5199.1146 |
| ids.doi | https://doi.org/10.24200/sci.2018.5199.1146 |
| ids.mag | 2913074586 |
| ids.openalex | https://openalex.org/W2913074586 |
| fwci | 0.0 |
| type | article |
| title | The stage shop scheduling problem: lower bound and metaheuristic |
| biblio.issue | 0 |
| biblio.volume | 0 |
| biblio.last_page | 0 |
| biblio.first_page | 0 |
| topics[0].id | https://openalex.org/T10551 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2209 |
| topics[0].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[0].display_name | Scheduling and Optimization Algorithms |
| topics[1].id | https://openalex.org/T11814 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.996399998664856 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Advanced Manufacturing and Logistics Optimization |
| topics[2].id | https://openalex.org/T12176 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9950000047683716 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2209 |
| topics[2].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[2].display_name | Optimization and Packing Problems |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C55416958 |
| concepts[0].level | 3 |
| concepts[0].score | 0.8334583044052124 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q6206757 |
| concepts[0].display_name | Job shop scheduling |
| concepts[1].id | https://openalex.org/C109718341 |
| concepts[1].level | 2 |
| concepts[1].score | 0.716307520866394 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[1].display_name | Metaheuristic |
| concepts[2].id | https://openalex.org/C126255220 |
| concepts[2].level | 1 |
| concepts[2].score | 0.6575163006782532 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[2].display_name | Mathematical optimization |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.6466504335403442 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C2778770139 |
| concepts[4].level | 2 |
| concepts[4].score | 0.6207982897758484 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q1966904 |
| concepts[4].display_name | Solver |
| concepts[5].id | https://openalex.org/C33099171 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5366551280021667 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q26208718 |
| concepts[5].display_name | Harmony search |
| concepts[6].id | https://openalex.org/C154982244 |
| concepts[6].level | 3 |
| concepts[6].score | 0.5254889130592346 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q5451844 |
| concepts[6].display_name | Firefly algorithm |
| concepts[7].id | https://openalex.org/C2777243215 |
| concepts[7].level | 5 |
| concepts[7].score | 0.5128753185272217 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1493226 |
| concepts[7].display_name | Job shop |
| concepts[8].id | https://openalex.org/C158336966 |
| concepts[8].level | 4 |
| concepts[8].score | 0.4972887337207794 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3074426 |
| concepts[8].display_name | Flow shop scheduling |
| concepts[9].id | https://openalex.org/C206729178 |
| concepts[9].level | 2 |
| concepts[9].score | 0.44245627522468567 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q2271896 |
| concepts[9].display_name | Scheduling (production processes) |
| concepts[10].id | https://openalex.org/C77553402 |
| concepts[10].level | 2 |
| concepts[10].score | 0.44184374809265137 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q13222579 |
| concepts[10].display_name | Upper and lower bounds |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.2457437515258789 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C111919701 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[12].display_name | Operating system |
| concepts[13].id | https://openalex.org/C68387754 |
| concepts[13].level | 2 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[13].display_name | Schedule |
| concepts[14].id | https://openalex.org/C85617194 |
| concepts[14].level | 2 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q2072794 |
| concepts[14].display_name | Particle swarm optimization |
| concepts[15].id | https://openalex.org/C134306372 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[15].display_name | Mathematical analysis |
| keywords[0].id | https://openalex.org/keywords/job-shop-scheduling |
| keywords[0].score | 0.8334583044052124 |
| keywords[0].display_name | Job shop scheduling |
| keywords[1].id | https://openalex.org/keywords/metaheuristic |
| keywords[1].score | 0.716307520866394 |
| keywords[1].display_name | Metaheuristic |
| keywords[2].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[2].score | 0.6575163006782532 |
| keywords[2].display_name | Mathematical optimization |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.6466504335403442 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/solver |
| keywords[4].score | 0.6207982897758484 |
| keywords[4].display_name | Solver |
| keywords[5].id | https://openalex.org/keywords/harmony-search |
| keywords[5].score | 0.5366551280021667 |
| keywords[5].display_name | Harmony search |
| keywords[6].id | https://openalex.org/keywords/firefly-algorithm |
| keywords[6].score | 0.5254889130592346 |
| keywords[6].display_name | Firefly algorithm |
| keywords[7].id | https://openalex.org/keywords/job-shop |
| keywords[7].score | 0.5128753185272217 |
| keywords[7].display_name | Job shop |
| keywords[8].id | https://openalex.org/keywords/flow-shop-scheduling |
| keywords[8].score | 0.4972887337207794 |
| keywords[8].display_name | Flow shop scheduling |
| keywords[9].id | https://openalex.org/keywords/scheduling |
| keywords[9].score | 0.44245627522468567 |
| keywords[9].display_name | Scheduling (production processes) |
| keywords[10].id | https://openalex.org/keywords/upper-and-lower-bounds |
| keywords[10].score | 0.44184374809265137 |
| keywords[10].display_name | Upper and lower bounds |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.2457437515258789 |
| keywords[11].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.24200/sci.2018.5199.1146 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2498435459 |
| locations[0].source.issn | 1026-3098, 2345-3605 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 1026-3098 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Scientia Iranica |
| locations[0].source.host_organization | https://openalex.org/P4310319005 |
| locations[0].source.host_organization_name | Sharif University of Technology |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319005 |
| locations[0].license | |
| locations[0].pdf_url | http://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Scientia Iranica |
| locations[0].landing_page_url | https://doi.org/10.24200/sci.2018.5199.1146 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5012668029 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9813-1233 |
| authorships[0].author.display_name | Mohammad Mahdi Nasiri |
| authorships[0].countries | IR |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I23946033 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| authorships[0].institutions[0].id | https://openalex.org/I23946033 |
| authorships[0].institutions[0].ror | https://ror.org/05vf56z40 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I23946033 |
| authorships[0].institutions[0].country_code | IR |
| authorships[0].institutions[0].display_name | University of Tehran |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Mohammad Mahdi Nasiri |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| authorships[1].author.id | https://openalex.org/A5063533384 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1498-7507 |
| authorships[1].author.display_name | Mahdi Hamid |
| authorships[1].countries | IR |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I23946033 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| authorships[1].institutions[0].id | https://openalex.org/I23946033 |
| authorships[1].institutions[0].ror | https://ror.org/05vf56z40 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I23946033 |
| authorships[1].institutions[0].country_code | IR |
| authorships[1].institutions[0].display_name | University of Tehran |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Mahdi Hamid |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdf |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | The stage shop scheduling problem: lower bound and metaheuristic |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10551 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2209 |
| primary_topic.subfield.display_name | Industrial and Manufacturing Engineering |
| primary_topic.display_name | Scheduling and Optimization Algorithms |
| related_works | https://openalex.org/W4376880131, https://openalex.org/W1496413023, https://openalex.org/W4307526247, https://openalex.org/W2596852793, https://openalex.org/W4200518988, https://openalex.org/W2361792200, https://openalex.org/W4283382030, https://openalex.org/W2765505702, https://openalex.org/W2945396167, https://openalex.org/W101238908 |
| cited_by_count | 8 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 4 |
| counts_by_year[1].year | 2023 |
| counts_by_year[1].cited_by_count | 2 |
| counts_by_year[2].year | 2022 |
| counts_by_year[2].cited_by_count | 2 |
| locations_count | 1 |
| best_oa_location.id | doi:10.24200/sci.2018.5199.1146 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2498435459 |
| best_oa_location.source.issn | 1026-3098, 2345-3605 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 1026-3098 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Scientia Iranica |
| best_oa_location.source.host_organization | https://openalex.org/P4310319005 |
| best_oa_location.source.host_organization_name | Sharif University of Technology |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319005 |
| best_oa_location.license | |
| best_oa_location.pdf_url | http://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Scientia Iranica |
| best_oa_location.landing_page_url | https://doi.org/10.24200/sci.2018.5199.1146 |
| primary_location.id | doi:10.24200/sci.2018.5199.1146 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2498435459 |
| primary_location.source.issn | 1026-3098, 2345-3605 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 1026-3098 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Scientia Iranica |
| primary_location.source.host_organization | https://openalex.org/P4310319005 |
| primary_location.source.host_organization_name | Sharif University of Technology |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319005 |
| primary_location.license | |
| primary_location.pdf_url | http://scientiairanica.sharif.edu/article_21119_50205ecc975ce43db0505ca7e11c83e1.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Scientia Iranica |
| primary_location.landing_page_url | https://doi.org/10.24200/sci.2018.5199.1146 |
| publication_date | 2018-11-03 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W6606587097, https://openalex.org/W6662042222, https://openalex.org/W6816750171, https://openalex.org/W2087138863, https://openalex.org/W2156773695, https://openalex.org/W1990521870, https://openalex.org/W2000809807, https://openalex.org/W2339315977, https://openalex.org/W4229954146, https://openalex.org/W180398283, https://openalex.org/W2028826326, https://openalex.org/W2007669147, https://openalex.org/W2014765467, https://openalex.org/W2022026355, https://openalex.org/W1993885071, https://openalex.org/W2144605535, https://openalex.org/W2094760523, https://openalex.org/W2793088185, https://openalex.org/W2122967269, https://openalex.org/W2091564852, https://openalex.org/W2607795493, https://openalex.org/W2605575499, https://openalex.org/W1963997960, https://openalex.org/W1596914020, https://openalex.org/W2156391157, https://openalex.org/W2070389897, https://openalex.org/W1973047669, https://openalex.org/W2289318735, https://openalex.org/W2734854649, https://openalex.org/W2040789431, https://openalex.org/W2129121437, https://openalex.org/W2029856600, https://openalex.org/W2205180844, https://openalex.org/W2130343325, https://openalex.org/W2059887572 |
| referenced_works_count | 35 |
| abstract_inverted_index.A | 45 |
| abstract_inverted_index.a | 15, 50, 55, 76, 85, 114, 127, 164 |
| abstract_inverted_index.As | 14 |
| abstract_inverted_index.In | 79, 99, 131 |
| abstract_inverted_index.an | 25, 102 |
| abstract_inverted_index.as | 24 |
| abstract_inverted_index.be | 22, 48, 62, 73, 88 |
| abstract_inverted_index.in | 27, 64, 75, 118, 126 |
| abstract_inverted_index.is | 31, 121 |
| abstract_inverted_index.of | 33, 52, 54, 84, 93, 151 |
| abstract_inverted_index.on | 107 |
| abstract_inverted_index.or | 43 |
| abstract_inverted_index.to | 4, 12, 146 |
| abstract_inverted_index.up | 11 |
| abstract_inverted_index.The | 149 |
| abstract_inverted_index.all | 91 |
| abstract_inverted_index.and | 36, 139, 163 |
| abstract_inverted_index.any | 65 |
| abstract_inverted_index.are | 2, 97, 144, 154 |
| abstract_inverted_index.can | 21, 47, 61 |
| abstract_inverted_index.for | 123 |
| abstract_inverted_index.job | 7, 30 |
| abstract_inverted_index.may | 39 |
| abstract_inverted_index.one | 41 |
| abstract_inverted_index.the | 6, 18, 70, 82, 94, 109, 124, 147, 152, 159 |
| abstract_inverted_index.done | 63 |
| abstract_inverted_index.each | 29, 37, 157 |
| abstract_inverted_index.job, | 56 |
| abstract_inverted_index.made | 3 |
| abstract_inverted_index.now. | 13 |
| abstract_inverted_index.open | 111 |
| abstract_inverted_index.shop | 8, 20, 112, 129 |
| abstract_inverted_index.some | 34 |
| abstract_inverted_index.such | 57 |
| abstract_inverted_index.that | 58 |
| abstract_inverted_index.this | 100 |
| abstract_inverted_index.wave | 141 |
| abstract_inverted_index.with | 156 |
| abstract_inverted_index.based | 106 |
| abstract_inverted_index.bound | 105 |
| abstract_inverted_index.lower | 104, 161 |
| abstract_inverted_index.model | 117 |
| abstract_inverted_index.more. | 44 |
| abstract_inverted_index.novel | 16 |
| abstract_inverted_index.order | 68 |
| abstract_inverted_index.other | 80 |
| abstract_inverted_index.prior | 95 |
| abstract_inverted_index.stage | 19, 38, 46, 86, 96, 128 |
| abstract_inverted_index.these | 59 |
| abstract_inverted_index.three | 133 |
| abstract_inverted_index.time) | 120 |
| abstract_inverted_index.until | 90 |
| abstract_inverted_index.water | 140 |
| abstract_inverted_index.which | 28 |
| abstract_inverted_index.while | 69 |
| abstract_inverted_index.(using | 113 |
| abstract_inverted_index.bound, | 162 |
| abstract_inverted_index.cannot | 87 |
| abstract_inverted_index.linear | 115 |
| abstract_inverted_index.order. | 78 |
| abstract_inverted_index.other, | 158 |
| abstract_inverted_index.paper, | 101 |
| abstract_inverted_index.search | 138 |
| abstract_inverted_index.should | 72 |
| abstract_inverted_index.stages | 35, 71 |
| abstract_inverted_index.subset | 51 |
| abstract_inverted_index.words, | 81 |
| abstract_inverted_index.applied | 145 |
| abstract_inverted_index.defined | 23, 49 |
| abstract_inverted_index.develop | 5 |
| abstract_inverted_index.devised | 122 |
| abstract_inverted_index.efforts | 1 |
| abstract_inverted_index.harmony | 137 |
| abstract_inverted_index.include | 40 |
| abstract_inverted_index.problem | 10 |
| abstract_inverted_index.results | 150 |
| abstract_inverted_index.solver. | 166 |
| abstract_inverted_index.solving | 108 |
| abstract_inverted_index.compared | 155 |
| abstract_inverted_index.composed | 32 |
| abstract_inverted_index.firefly, | 136 |
| abstract_inverted_index.makespan | 125 |
| abstract_inverted_index.problem. | 130, 148 |
| abstract_inverted_index.proposed | 160 |
| abstract_inverted_index.relative | 67 |
| abstract_inverted_index.addition, | 132 |
| abstract_inverted_index.arbitrary | 66 |
| abstract_inverted_index.including | 135 |
| abstract_inverted_index.initiated | 89 |
| abstract_inverted_index.operation | 42 |
| abstract_inverted_index.processed | 74 |
| abstract_inverted_index.Remarkable | 0 |
| abstract_inverted_index.algorithms | 143, 153 |
| abstract_inverted_index.commercial | 165 |
| abstract_inverted_index.completed. | 98 |
| abstract_inverted_index.innovative | 103 |
| abstract_inverted_index.operations | 53, 60, 83, 92 |
| abstract_inverted_index.polynomial | 119 |
| abstract_inverted_index.preemptive | 110 |
| abstract_inverted_index.scheduling | 9 |
| abstract_inverted_index.programming | 116 |
| abstract_inverted_index.environment, | 26 |
| abstract_inverted_index.optimization | 142 |
| abstract_inverted_index.predetermined | 77 |
| abstract_inverted_index.generalization, | 17 |
| abstract_inverted_index.metaheuristics, | 134 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 94 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile.value | 0.23882135 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |