A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517)
From MaRDI portal
scientific article; zbMATH DE number 2002125
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for the minimum storage-time sequencing problem |
scientific article; zbMATH DE number 2002125 |
Statements
A branch and bound algorithm for the minimum storage-time sequencing problem (English)
0 references
10 November 2003
0 references
single processor scheduling
0 references
linear ordering
0 references
0 references
0 references
0 references
