Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347)
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: Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. |
scientific article; zbMATH DE number 1963722
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. |
scientific article; zbMATH DE number 1963722 |
Statements
Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (English)
0 references
13 August 2003
0 references
Cyclic scheduling
0 references
Flow time
0 references
Branch and bound
0 references
Lower bound
0 references
0 references
0 references
0 references
