EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - Journal - Bridge of Knowledge

Search

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

ISSN:

0377-2217

eISSN:

1872-6860

Disciplines
(Field of Science):

  • Automation, electronics, electrical engineering and space technologies (Engineering and Technology)
  • Information and communication technology (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)
  • Economics and finance (Social studies)
  • Management and quality studies (Social studies)
  • International relations (Social studies)
  • Computer and information sciences (Natural sciences)

Ministry points: Help

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

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 11.2
Points CiteScore - previous years
Year Points
2022 11.2
2021 10.5
2020 9.5
2019 8.5
2018 7.4
2017 6.9
2016 6
2015 5.4
2014 4.6
2013 5.5
2012 5.6
2011 5.5

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 9

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2022
Year 2020
  • Shared processor scheduling of multiprocessor jobs
    Publication

    We study a problem of shared processor scheduling of multiprocessor weighted jobs. Each job can be executed on its private processor and simultaneously on possibly many processors shared by all jobs. This simultaneous execution reduces their completion times due to the processing time overlap. Each of the m shared processors may charge a different fee but otherwise the processors are identical. The goal is to maximize the total...

    Full text to download in external service

Year 2017
  • Shared multi-processor scheduling
    Publication

    We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...

    Full text to download in external service

Year 2009
Year 2007
Year 2002
Year 2001
Year 1996
Year 1995

seen 579 times