Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Scheduling divisible loads with time and cost constraints

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2021

Published in

Journal of Scheduling

Journal year: 2021 | Journal volume: vol. 24 | Journal number: iss. 5

Article type

scientific article

Publication language

english

Keywords
EN
  • Divisible load scheduling
  • Computational complexity
  • Linear programming
Date of online publication

20.11.2019

Pages (from - to)

507 - 521

DOI

10.1007/s10951-019-00626-6

URL

https://link.springer.com/article/10.1007/s10951-019-00626-6

License type

CC BY (attribution alone)

Open Access Mode

czasopismo hybrydowe

Open Access Text Version

final published version

Date of Open Access to the publication

in press

Ministry points / journal

70

Ministry points / journal in years 2017-2021

70

Impact Factor

2,13

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.