Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (Q955602)
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 of parallel machines to minimize total completion time subject to s-precedence constraints |
scientific article; zbMATH DE number 5369393
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints |
scientific article; zbMATH DE number 5369393 |
Statements
Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints (English)
0 references
20 November 2008
0 references
parallel machine scheduling
0 references
precedence constraints
0 references
total completion time
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
