A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6872386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines |
scientific article; zbMATH DE number 6872386 |
Statements
A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (English)
0 references
24 May 2018
0 references
parallel-machine scheduling
0 references
directed graph
0 references
algorithmic complexity
0 references
0 references
0 references
0.9201953411102296
0 references
0.8041398525238037
0 references
0.8041397929191589
0 references
