Scheduling with a limited testing budget Article Swipe
Christoph Damerius
,
Peter Kling
,
Minming Li
,
Chenyang Xu
,
Ruilong Zhang
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37
IWDSP 2023, similarly as the previous three workshops in the series, focuses on dynamic scheduling problems defined by parameters whose values are varying in time and which often appear in applications.Therefore, main topics related to the workshop scope include scheduling with variable job processing, e.g.controllable job processing times, time-dependent job processing times, position-dependent job processing times, resource-dependent job processing times, discretecontinuous scheduling;scheduling with various factors affecting job execution, e.g.aging, alteration, deterioration, learning, shortening; scheduling on variable speed machines, e.g.energy-efficient scheduling, scheduling under time-of-use electricity tariffs, scheduling with ratemodifying activities;scheduling problems with constraints on machine availability, e.g.scheduling with maintenance activities, scheduling on machines with non-availability periods; scheduling under uncertainty, e.g.robust scheduling, stochastic scheduling, scheduling over scenarios, scheduling with explorable uncertainty;scheduling with a partial, changing in time, data on jobs or machines, e.g.online scheduling, semi-online scheduling; scheduling in non-classic models of job preemption, e.g.malleable task scheduling, scheduling pliable jobs, scheduling splittable jobs; other scheduling problems with job or machine parameters changing in time, e.g.scheduling in data gathering networks, scheduling in health care systems, etc.The aim of the IWDSP 2023 workshop is to present the recent research in these important domains of scheduling theory.
Related Topics
Concepts
Rate-monotonic scheduling
Fair-share scheduling
Two-level scheduling
Dynamic priority scheduling
Fixed-priority pre-emptive scheduling
Computer science
Round-robin scheduling
Earliest deadline first scheduling
Lottery scheduling
Flow shop scheduling
Least slack time scheduling
Distributed computing
Schedule
Operating system
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37
- https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37
- OA Status
- gold
- Cited By
- 1
- References
- 140
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4390711951
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4390711951Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37Digital Object Identifier
- Title
-
Scheduling with a limited testing budgetWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-10-01Full publication date if available
- Authors
-
Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong ZhangList of authors in order
- Landing page
-
https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37Publisher landing page
- PDF URL
-
https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37Direct OA link when available
- Concepts
-
Rate-monotonic scheduling, Fair-share scheduling, Two-level scheduling, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling, Computer science, Round-robin scheduling, Earliest deadline first scheduling, Lottery scheduling, Flow shop scheduling, Least slack time scheduling, Distributed computing, Schedule, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 1Per-year citation counts (last 5 years)
- References (count)
-
140Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4390711951 |
|---|---|
| doi | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| ids.doi | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| ids.openalex | https://openalex.org/W4390711951 |
| fwci | 0.28551373 |
| type | article |
| title | Scheduling with a limited testing budget |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | 37 |
| biblio.first_page | 31 |
| 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 | 0.9998000264167786 |
| 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/T10974 |
| topics[1].field.id | https://openalex.org/fields/14 |
| topics[1].field.display_name | Business, Management and Accounting |
| topics[1].score | 0.9887999892234802 |
| topics[1].domain.id | https://openalex.org/domains/2 |
| topics[1].domain.display_name | Social Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1404 |
| topics[1].subfield.display_name | Management Information Systems |
| topics[1].display_name | Advanced Queuing Theory Analysis |
| topics[2].id | https://openalex.org/T11814 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9854999780654907 |
| 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 | Advanced Manufacturing and Logistics Optimization |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C127456818 |
| concepts[0].level | 4 |
| concepts[0].score | 0.7856292128562927 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q238879 |
| concepts[0].display_name | Rate-monotonic scheduling |
| concepts[1].id | https://openalex.org/C31689143 |
| concepts[1].level | 3 |
| concepts[1].score | 0.77726149559021 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q733809 |
| concepts[1].display_name | Fair-share scheduling |
| concepts[2].id | https://openalex.org/C119948110 |
| concepts[2].level | 4 |
| concepts[2].score | 0.7739441394805908 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q7858726 |
| concepts[2].display_name | Two-level scheduling |
| concepts[3].id | https://openalex.org/C107568181 |
| concepts[3].level | 3 |
| concepts[3].score | 0.7239956855773926 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q5319000 |
| concepts[3].display_name | Dynamic priority scheduling |
| concepts[4].id | https://openalex.org/C122141398 |
| concepts[4].level | 5 |
| concepts[4].score | 0.682371199131012 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q5456330 |
| concepts[4].display_name | Fixed-priority pre-emptive scheduling |
| concepts[5].id | https://openalex.org/C41008148 |
| concepts[5].level | 0 |
| concepts[5].score | 0.6804007887840271 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[5].display_name | Computer science |
| concepts[6].id | https://openalex.org/C175893541 |
| concepts[6].level | 4 |
| concepts[6].score | 0.6595824956893921 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q1196582 |
| concepts[6].display_name | Round-robin scheduling |
| concepts[7].id | https://openalex.org/C32310161 |
| concepts[7].level | 5 |
| concepts[7].score | 0.622382640838623 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q666365 |
| concepts[7].display_name | Earliest deadline first scheduling |
| concepts[8].id | https://openalex.org/C112866106 |
| concepts[8].level | 5 |
| concepts[8].score | 0.617929220199585 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q267053 |
| concepts[8].display_name | Lottery scheduling |
| concepts[9].id | https://openalex.org/C158336966 |
| concepts[9].level | 4 |
| concepts[9].score | 0.5967159271240234 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q3074426 |
| concepts[9].display_name | Flow shop scheduling |
| concepts[10].id | https://openalex.org/C132439773 |
| concepts[10].level | 5 |
| concepts[10].score | 0.518608570098877 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q1810747 |
| concepts[10].display_name | Least slack time scheduling |
| concepts[11].id | https://openalex.org/C120314980 |
| concepts[11].level | 1 |
| concepts[11].score | 0.4379371404647827 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[11].display_name | Distributed computing |
| concepts[12].id | https://openalex.org/C68387754 |
| concepts[12].level | 2 |
| concepts[12].score | 0.14783763885498047 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[12].display_name | Schedule |
| concepts[13].id | https://openalex.org/C111919701 |
| concepts[13].level | 1 |
| concepts[13].score | 0.10535329580307007 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[13].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/rate-monotonic-scheduling |
| keywords[0].score | 0.7856292128562927 |
| keywords[0].display_name | Rate-monotonic scheduling |
| keywords[1].id | https://openalex.org/keywords/fair-share-scheduling |
| keywords[1].score | 0.77726149559021 |
| keywords[1].display_name | Fair-share scheduling |
| keywords[2].id | https://openalex.org/keywords/two-level-scheduling |
| keywords[2].score | 0.7739441394805908 |
| keywords[2].display_name | Two-level scheduling |
| keywords[3].id | https://openalex.org/keywords/dynamic-priority-scheduling |
| keywords[3].score | 0.7239956855773926 |
| keywords[3].display_name | Dynamic priority scheduling |
| keywords[4].id | https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling |
| keywords[4].score | 0.682371199131012 |
| keywords[4].display_name | Fixed-priority pre-emptive scheduling |
| keywords[5].id | https://openalex.org/keywords/computer-science |
| keywords[5].score | 0.6804007887840271 |
| keywords[5].display_name | Computer science |
| keywords[6].id | https://openalex.org/keywords/round-robin-scheduling |
| keywords[6].score | 0.6595824956893921 |
| keywords[6].display_name | Round-robin scheduling |
| keywords[7].id | https://openalex.org/keywords/earliest-deadline-first-scheduling |
| keywords[7].score | 0.622382640838623 |
| keywords[7].display_name | Earliest deadline first scheduling |
| keywords[8].id | https://openalex.org/keywords/lottery-scheduling |
| keywords[8].score | 0.617929220199585 |
| keywords[8].display_name | Lottery scheduling |
| keywords[9].id | https://openalex.org/keywords/flow-shop-scheduling |
| keywords[9].score | 0.5967159271240234 |
| keywords[9].display_name | Flow shop scheduling |
| keywords[10].id | https://openalex.org/keywords/least-slack-time-scheduling |
| keywords[10].score | 0.518608570098877 |
| keywords[10].display_name | Least slack time scheduling |
| keywords[11].id | https://openalex.org/keywords/distributed-computing |
| keywords[11].score | 0.4379371404647827 |
| keywords[11].display_name | Distributed computing |
| keywords[12].id | https://openalex.org/keywords/schedule |
| keywords[12].score | 0.14783763885498047 |
| keywords[12].display_name | Schedule |
| keywords[13].id | https://openalex.org/keywords/operating-system |
| keywords[13].score | 0.10535329580307007 |
| keywords[13].display_name | Operating system |
| language | en |
| locations[0].id | doi:10.14708/isbn.978-83-962157-1-0p31-37 |
| locations[0].is_oa | True |
| locations[0].source | |
| locations[0].license | |
| locations[0].pdf_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | The Fourth International Workshop on Dynamic Scheduling Problems, Zurich University of Applied Sciences (ZHAW) School of Engineering, June 5th–6th, 2023, Winterthur, Switzerland |
| locations[0].landing_page_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5073258279 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Christoph Damerius |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Christoph Damerius |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5007675663 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-0000-8689 |
| authorships[1].author.display_name | Peter Kling |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Peter Kling |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5085884127 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-7370-6237 |
| authorships[2].author.display_name | Minming Li |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Minming Li |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5089035530 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-6837-2906 |
| authorships[3].author.display_name | Chenyang Xu |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Chenyang Xu |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5014987921 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-4859-2661 |
| authorships[4].author.display_name | Ruilong Zhang |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Ruilong Zhang |
| authorships[4].is_corresponding | False |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Scheduling with a limited testing budget |
| 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 | 0.9998000264167786 |
| 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/W2167574351, https://openalex.org/W2184166483, https://openalex.org/W1545991362, https://openalex.org/W4390711911, https://openalex.org/W4390722066, https://openalex.org/W4390711910, https://openalex.org/W4390711934, https://openalex.org/W4390711927, https://openalex.org/W2225350526, https://openalex.org/W4390722068 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.14708/isbn.978-83-962157-1-0p31-37 |
| best_oa_location.is_oa | True |
| best_oa_location.source | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | The Fourth International Workshop on Dynamic Scheduling Problems, Zurich University of Applied Sciences (ZHAW) School of Engineering, June 5th–6th, 2023, Winterthur, Switzerland |
| best_oa_location.landing_page_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| primary_location.id | doi:10.14708/isbn.978-83-962157-1-0p31-37 |
| primary_location.is_oa | True |
| primary_location.source | |
| primary_location.license | |
| primary_location.pdf_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | The Fourth International Workshop on Dynamic Scheduling Problems, Zurich University of Applied Sciences (ZHAW) School of Engineering, June 5th–6th, 2023, Winterthur, Switzerland |
| primary_location.landing_page_url | https://doi.org/10.14708/isbn.978-83-962157-1-0p31-37 |
| publication_date | 2023-10-01 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W2116509768, https://openalex.org/W2424274037, https://openalex.org/W1983916623, https://openalex.org/W4309279635, https://openalex.org/W1891704960, https://openalex.org/W2916807216, https://openalex.org/W3008688573, https://openalex.org/W3119302918, https://openalex.org/W4285810177, https://openalex.org/W3128881933, https://openalex.org/W2118022895, https://openalex.org/W3198836384, https://openalex.org/W2804381476, https://openalex.org/W2116037476, https://openalex.org/W3041182549, https://openalex.org/W2955229224, https://openalex.org/W2127685766, https://openalex.org/W1975766702, https://openalex.org/W2009850837, https://openalex.org/W1977541338, https://openalex.org/W2023838852, https://openalex.org/W3003314034, https://openalex.org/W3034470636, https://openalex.org/W2084399987, https://openalex.org/W2082878518, https://openalex.org/W2091290638, https://openalex.org/W2115299891, https://openalex.org/W4381304672, https://openalex.org/W1985495277, https://openalex.org/W3211492119, https://openalex.org/W4281710052, https://openalex.org/W1967455912, https://openalex.org/W2014687183, https://openalex.org/W4362585307, https://openalex.org/W1981229180, https://openalex.org/W1997261476, https://openalex.org/W2003673940, https://openalex.org/W4313829758, https://openalex.org/W2047909764, https://openalex.org/W1965928330, https://openalex.org/W1999459348, https://openalex.org/W4309840145, https://openalex.org/W2024784120, https://openalex.org/W4318051935, https://openalex.org/W4239618018, https://openalex.org/W3132103190, https://openalex.org/W2003746847, https://openalex.org/W4323669913, https://openalex.org/W3121401330, https://openalex.org/W1981736216, https://openalex.org/W2060597711, https://openalex.org/W4221103730, https://openalex.org/W2000709104, https://openalex.org/W4283024855, https://openalex.org/W3008226559, https://openalex.org/W4321352472, https://openalex.org/W3134126718, https://openalex.org/W2963954604, https://openalex.org/W3045331303, https://openalex.org/W3092390214, https://openalex.org/W4224007534, https://openalex.org/W3177621706, https://openalex.org/W4206816655, https://openalex.org/W2971245531, https://openalex.org/W4321850361, https://openalex.org/W2530743302, https://openalex.org/W2896866264, https://openalex.org/W2779207047, https://openalex.org/W2779360634, https://openalex.org/W2171056894, https://openalex.org/W2897353798, https://openalex.org/W2998332574, https://openalex.org/W2401003111, https://openalex.org/W2093067706, https://openalex.org/W2212678890, https://openalex.org/W1975784696, https://openalex.org/W1992216074, https://openalex.org/W4236796530, https://openalex.org/W2884627906, https://openalex.org/W2893074017, https://openalex.org/W2083771036, https://openalex.org/W4312948471, https://openalex.org/W4309542902, https://openalex.org/W3025383415, https://openalex.org/W2576263575, https://openalex.org/W2005416609, https://openalex.org/W2155047985, https://openalex.org/W3157589894, https://openalex.org/W2104178995, https://openalex.org/W2049407747, https://openalex.org/W3007751764, https://openalex.org/W3123029573, https://openalex.org/W1972249265, https://openalex.org/W2133249969, https://openalex.org/W2049573086, https://openalex.org/W3158623846, https://openalex.org/W2753336172, https://openalex.org/W2146219471, https://openalex.org/W1984809851, https://openalex.org/W2157793635, https://openalex.org/W2131116400, https://openalex.org/W2118578357, https://openalex.org/W2045271791, https://openalex.org/W1997235685, https://openalex.org/W2045527118, https://openalex.org/W3097645244, https://openalex.org/W2285365016, https://openalex.org/W2801426780, https://openalex.org/W2999208346, https://openalex.org/W2028704098, https://openalex.org/W2140496876, https://openalex.org/W1987126439, https://openalex.org/W2010919407, https://openalex.org/W2092821066, https://openalex.org/W2082601865, https://openalex.org/W2110088385, https://openalex.org/W2999701736, https://openalex.org/W2490573886, https://openalex.org/W2900417123, https://openalex.org/W3096639273, https://openalex.org/W2973381151, https://openalex.org/W2041010530, https://openalex.org/W3165185214, https://openalex.org/W2024085737, https://openalex.org/W2089445742, https://openalex.org/W2067297441, https://openalex.org/W1988565742, https://openalex.org/W3014969101, https://openalex.org/W3183786176, https://openalex.org/W3159712842, https://openalex.org/W3159741798, https://openalex.org/W2547215075, https://openalex.org/W1977545325, https://openalex.org/W2538372929, https://openalex.org/W4205323227, https://openalex.org/W4226299618, https://openalex.org/W420657877, https://openalex.org/W2165775468, https://openalex.org/W2011039300, https://openalex.org/W2754604279 |
| referenced_works_count | 140 |
| abstract_inverted_index.a | 120 |
| abstract_inverted_index.as | 3 |
| abstract_inverted_index.by | 17 |
| abstract_inverted_index.in | 8, 23, 29, 123, 135, 159, 162, 167, 184 |
| abstract_inverted_index.is | 178 |
| abstract_inverted_index.of | 138, 173, 188 |
| abstract_inverted_index.on | 12, 74, 92, 100, 126 |
| abstract_inverted_index.or | 128, 155 |
| abstract_inverted_index.to | 34, 179 |
| abstract_inverted_index.aim | 172 |
| abstract_inverted_index.and | 25 |
| abstract_inverted_index.are | 21 |
| abstract_inverted_index.job | 42, 45, 49, 53, 57, 66, 139, 154 |
| abstract_inverted_index.the | 4, 9, 35, 174, 181 |
| abstract_inverted_index.2023 | 176 |
| abstract_inverted_index.care | 169 |
| abstract_inverted_index.data | 125, 163 |
| abstract_inverted_index.jobs | 127 |
| abstract_inverted_index.main | 31 |
| abstract_inverted_index.over | 113 |
| abstract_inverted_index.task | 142 |
| abstract_inverted_index.time | 24 |
| abstract_inverted_index.with | 40, 62, 86, 90, 96, 102, 116, 119, 153 |
| abstract_inverted_index.2023, | 1 |
| abstract_inverted_index.IWDSP | 0, 175 |
| abstract_inverted_index.jobs, | 146 |
| abstract_inverted_index.jobs; | 149 |
| abstract_inverted_index.often | 27 |
| abstract_inverted_index.other | 150 |
| abstract_inverted_index.scope | 37 |
| abstract_inverted_index.speed | 76 |
| abstract_inverted_index.these | 185 |
| abstract_inverted_index.three | 6 |
| abstract_inverted_index.time, | 124, 160 |
| abstract_inverted_index.under | 81, 106 |
| abstract_inverted_index.which | 26 |
| abstract_inverted_index.whose | 19 |
| abstract_inverted_index.appear | 28 |
| abstract_inverted_index.health | 168 |
| abstract_inverted_index.models | 137 |
| abstract_inverted_index.recent | 182 |
| abstract_inverted_index.times, | 47, 51, 55, 59 |
| abstract_inverted_index.topics | 32 |
| abstract_inverted_index.values | 20 |
| abstract_inverted_index.defined | 16 |
| abstract_inverted_index.domains | 187 |
| abstract_inverted_index.dynamic | 13 |
| abstract_inverted_index.etc.The | 171 |
| abstract_inverted_index.factors | 64 |
| abstract_inverted_index.focuses | 11 |
| abstract_inverted_index.include | 38 |
| abstract_inverted_index.machine | 93, 156 |
| abstract_inverted_index.pliable | 145 |
| abstract_inverted_index.present | 180 |
| abstract_inverted_index.related | 33 |
| abstract_inverted_index.series, | 10 |
| abstract_inverted_index.theory. | 190 |
| abstract_inverted_index.various | 63 |
| abstract_inverted_index.varying | 22 |
| abstract_inverted_index.changing | 122, 158 |
| abstract_inverted_index.machines | 101 |
| abstract_inverted_index.partial, | 121 |
| abstract_inverted_index.periods; | 104 |
| abstract_inverted_index.previous | 5 |
| abstract_inverted_index.problems | 15, 89, 152 |
| abstract_inverted_index.research | 183 |
| abstract_inverted_index.systems, | 170 |
| abstract_inverted_index.tariffs, | 84 |
| abstract_inverted_index.variable | 41, 75 |
| abstract_inverted_index.workshop | 36, 177 |
| abstract_inverted_index.affecting | 65 |
| abstract_inverted_index.gathering | 164 |
| abstract_inverted_index.important | 186 |
| abstract_inverted_index.learning, | 71 |
| abstract_inverted_index.machines, | 77, 129 |
| abstract_inverted_index.networks, | 165 |
| abstract_inverted_index.similarly | 2 |
| abstract_inverted_index.workshops | 7 |
| abstract_inverted_index.e.g.aging, | 68 |
| abstract_inverted_index.e.g.online | 130 |
| abstract_inverted_index.e.g.robust | 108 |
| abstract_inverted_index.execution, | 67 |
| abstract_inverted_index.explorable | 117 |
| abstract_inverted_index.parameters | 18, 157 |
| abstract_inverted_index.processing | 46, 50, 54, 58 |
| abstract_inverted_index.scenarios, | 114 |
| abstract_inverted_index.scheduling | 14, 39, 73, 80, 85, 99, 105, 112, 115, 134, 144, 147, 151, 166, 189 |
| abstract_inverted_index.splittable | 148 |
| abstract_inverted_index.stochastic | 110 |
| abstract_inverted_index.activities, | 98 |
| abstract_inverted_index.alteration, | 69 |
| abstract_inverted_index.constraints | 91 |
| abstract_inverted_index.electricity | 83 |
| abstract_inverted_index.maintenance | 97 |
| abstract_inverted_index.non-classic | 136 |
| abstract_inverted_index.preemption, | 140 |
| abstract_inverted_index.processing, | 43 |
| abstract_inverted_index.scheduling, | 79, 109, 111, 131, 143 |
| abstract_inverted_index.scheduling; | 133 |
| abstract_inverted_index.semi-online | 132 |
| abstract_inverted_index.shortening; | 72 |
| abstract_inverted_index.time-of-use | 82 |
| abstract_inverted_index.uncertainty, | 107 |
| abstract_inverted_index.availability, | 94 |
| abstract_inverted_index.e.g.malleable | 141 |
| abstract_inverted_index.ratemodifying | 87 |
| abstract_inverted_index.deterioration, | 70 |
| abstract_inverted_index.e.g.scheduling | 95, 161 |
| abstract_inverted_index.time-dependent | 48 |
| abstract_inverted_index.e.g.controllable | 44 |
| abstract_inverted_index.non-availability | 103 |
| abstract_inverted_index.discretecontinuous | 60 |
| abstract_inverted_index.position-dependent | 52 |
| abstract_inverted_index.resource-dependent | 56 |
| abstract_inverted_index.e.g.energy-efficient | 78 |
| abstract_inverted_index.activities;scheduling | 88 |
| abstract_inverted_index.scheduling;scheduling | 61 |
| abstract_inverted_index.uncertainty;scheduling | 118 |
| abstract_inverted_index.applications.Therefore, | 30 |
| cited_by_percentile_year.max | 95 |
| cited_by_percentile_year.min | 91 |
| countries_distinct_count | 0 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile.value | 0.64499076 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |