A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines (Q1752453): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:51, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines |
scientific article |
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
