ARTIFICIAL INTELLIGENCE - Journal - Bridge of Knowledge

ARTIFICIAL INTELLIGENCE

ISSN:

0004-3702

eISSN:

1872-7921

Disciplines
(Field of Science):

linguistics (Humanities)
culture and religion studies (Humanities)
automation, electronics, electrical engineering and space technologies (Engineering and Technology)
information and communication technology (Engineering and Technology)
safety engineering (Engineering and Technology)
biomedical engineering (Engineering and Technology)
international relations (Social studies)
computer and information sciences (Natural sciences)

expand collapse

Ministry points: Help

Ministry points - current year
Year	Points	List
Year 2025	200	Ministry scored journals list 2024

expand collapse

Ministry points - previous years
Year	Points	List
2025	200	Ministry scored journals list 2024
2024	200	Ministry scored journals list 2024
2023	200	Ministry Scored Journals List
2022	200	Ministry Scored Journals List 2019-2022
2021	200	Ministry Scored Journals List 2019-2022
2020	200	Ministry Scored Journals List 2019-2022
2019	200	Ministry Scored Journals List 2019-2022
2018	40	A
2017	40	A
2016	40	A
2015	40	A
2014	40	A
2013	35	A
2012	40	A
2011	40	A
2010	32	A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year	Points
Year 2023	11.2

expand collapse

Points CiteScore - previous years
Year	Points
2023	11.2
2022	11.4
2021	8.7
2020	8.3
2019	7.7
2018	7.7
2017	6.7
2016	9.5
2015	8.8
2014	8
2013	8.2
2012	7.2
2011	6.1

Impact Factor:

Log in to see the Impact Factor.

Sherpa Romeo:

https://v2.sherpa.ac.uk/id/publication/16728

Papers published in journal

results on page:
year:
- selected sort by year newest first
- sort by year oldest first
title:
- selected sort by title A-Z
- sort by title Z-A
citation:
- sort by citation descending
- sort by citation ascending

Filters

total: 1

Year 2022

Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
Publication
- T. Pikies
- K. Turowski
- M. Kubale
- ARTIFICIAL INTELLIGENCE - Year 2022
In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...

Full text to download in external service

seen 936 times