Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling identical jobs with chain precedence constraints on two uniform machines |
scientific article; zbMATH DE number 1439901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling identical jobs with chain precedence constraints on two uniform machines |
scientific article; zbMATH DE number 1439901 |
Statements
Scheduling identical jobs with chain precedence constraints on two uniform machines (English)
0 references
7 May 2000
0 references
Summery: The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time.
0 references
scheduling
0 references
uniform machines
0 references
identical jobs
0 references
chain precedence constraints
0 references
0.8461736440658569
0 references
0.8398735523223877
0 references
0.834155261516571
0 references
