Details

Title

Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines

Journal title

Bulletin of the Polish Academy of Sciences: Technical Sciences

Yearbook

2019

Volume

67

Numer

No. 1

Authors

Keywords

approximation algorithm ; graph coloring ; incompatible job ; polynomial algorithm ; scheduling ; uniform machine ; unit-time job

Divisions of PAS

Nauki Techniczne

Coverage

31-36

Date

28.02.2019\

Type

Artykuły / Articles

Identifier

DOI: 10.24425/bpas.2019.127335 ; ISSN 2300-1917

Source

Bulletin of the Polish Academy of Sciences: Technical Sciences; 2019; 67; No. 1; 31-36
×