Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- safety engineering (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- civil engineering, geodesy and transport (Engineering and Technology)
- mechanical engineering (Engineering and Technology)
- family studies (Family studies)
- management and quality studies (Social studies)
- educational sciences (Social studies)
- international relations (Social studies)
- computer and information sciences (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 70 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 70 | Ministry scored journals list 2024 |
| 2023 | 70 | Ministry Scored Journals List |
| 2022 | 70 | Ministry Scored Journals List 2019-2022 |
| 2021 | 70 | Ministry Scored Journals List 2019-2022 |
| 2020 | 70 | Ministry Scored Journals List 2019-2022 |
| 2019 | 70 | Ministry Scored Journals List 2019-2022 |
| 2018 | 30 | A |
| 2017 | 30 | A |
| 2016 | 25 | A |
| 2015 | 30 | A |
| 2014 | 30 | A |
| 2013 | 30 | A |
| 2012 | 40 | A |
| 2011 | 40 | A |
| 2010 | 32 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 3.8 |
| Year | Points |
|---|---|
| 2023 | 3.8 |
| 2022 | 3.7 |
| 2021 | 3.7 |
| 2020 | 3.4 |
| 2019 | 3.6 |
| 2018 | 3 |
| 2017 | 2.5 |
| 2016 | 2.6 |
| 2015 | 2.9 |
| 2014 | 3.2 |
| 2013 | 2.7 |
| 2012 | 3.1 |
| 2011 | 2.9 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 4
Catalog Journals
Year 2018
-
Shared processor scheduling
PublicationWe study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...
Year 2016
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
Year 2012
-
Routing equal-size messages on a slotted ring
PublicationAnalizujemy problem routingu wiadomości w sieci slotted ring, biorąc pod uwagę dwa kryteria optymalizacyjne: długość uszeregowania oraz liczbę 'cykli' pracy sieci. Optymalny routing dla wiadomości o rozmiarze k jest silnie NP-trudny, natomiast dla k=q, gdzie q jest rozmiarem sieci, można obliczyć w czsie O(n^2log n) dla pierwszego kryterium. Podajemy również algorytm o czasie działania O(nlog n) oraz o stałym współczynniku dobroci....
Year 2010
-
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
PublicationArtykuł podejmuje problem szeregowania zadań przy założeniu podziału czasu na sloty jednakowej długości, gdzie każde z zadań ma ustaloną długość oraz czas jego zakończenia, który jest relatywny do końca slotu. Problem znalezienia uszeregowania polega na dokonaniu przydziału zadań do poszczególnych slotów, przy czym w ogólności długość zadania może wymuszać sytuację, w której zadańie jest realizowane nie tylko w slocie, w którym...
seen 468 times