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.

Dissertation

Download BibTeX

Title

Algorytmy szeregowania zadań z kosztami wyprzedzeń i opóźnień na jednym procesorze

Authors

Promoter

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Reviewers

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Title variant

EN Algorithms for Single Processor Scheduling with Earliness and Tardiness Costs

Language

polish

Number of pages

86

Signature of printed version

DrOIN 978

On-line catalog

to2007049374

Full text of dissertation

no permission to download file

Access level to full text

archive

First review

Adam Janiak

Place

Wrocław, Polska

Date

20.06.2006

Language

polish

Review text

no permission to download file

Access level to review text

archive

Second review

Jan Węglarz

Place

Poznań, Polska

Date

10.09.2006

Language

polish

Review text

no permission to download file

Access level to review text

archive

Dissertation status

dissertation

Place of defense

Poznań, Polska

Date of defense

07.11.2006

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