Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (Q967809)
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 the makespan in a single machine scheduling problems with flexible and periodic maintenance |
scientific article; zbMATH DE number 5703192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance |
scientific article; zbMATH DE number 5703192 |
Statements
Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance (English)
0 references
2 May 2010
0 references
single machine scheduling
0 references
periodic maintenance
0 references
flexible maintenance
0 references
NP-hard
0 references
heuristic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9097663164138794
0 references
0.8859205842018127
0 references
0.8818050026893616
0 references
0.8811523914337158
0 references
