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

Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion

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

2020

Published in

International Journal of Applied Mathematics and Computer Science

Journal year: 2020 | Journal volume: vol. 30 | Journal number: no. 3

Article type

scientific article

Publication language

english

Keywords
EN
  • late work minimization
  • unrelated machines
  • tabu search
  • genetic algorithm
Pages (from - to)

573 - 584

DOI

10.34768/amcs-2020-0042

URL

https://www.amcs.uz.zgora.pl/?action=paper&paper=1572

License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Open Access Mode

publisher's website

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Ministry points / journal

100

Ministry points / journal in years 2017-2021

100

Impact Factor

1,417

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