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

Exact and heuristic algorithms for scheduling on two identical machines with early work maximization

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

Computers & Industrial Engineering

Journal year: 2020 | Journal volume: vol.144

Article type

scientific article

Publication language

english

Keywords
EN
  • scheduling
  • early work
  • identical machines
  • branch-and-bound algorithm
  • heuristic algorithm
Pages (from - to)

106449-1 - 106449-11

DOI

10.1016/j.cie.2020.106449

URL

https://doi.org/10.1016/j.cie.2020.106449

Ministry points / journal

140

Ministry points / journal in years 2017-2021

140

Impact Factor

5,431

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