Minimizing total completion time on a single machine with a flexible maintenance activity (Q613512)
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 total completion time on a single machine with a flexible maintenance activity |
scientific article; zbMATH DE number 5828291
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time on a single machine with a flexible maintenance activity |
scientific article; zbMATH DE number 5828291 |
Statements
Minimizing total completion time on a single machine with a flexible maintenance activity (English)
0 references
20 December 2010
0 references
single machine scheduling
0 references
flexible maintenance
0 references
shortest processing time
0 references
dynamic programming
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91195023
0 references
0.8929064
0 references
0.8928047
0 references
0.8869515
0 references
0 references
0.88174886
0 references
0.8800868
0 references
0.8780374
0 references
0.87802947
0 references
