On the computational complexity of (maximum) shift class scheduling (Q684343)
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: On the computational complexity of (maximum) shift class scheduling |
scientific article; zbMATH DE number 411081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of (maximum) shift class scheduling |
scientific article; zbMATH DE number 411081 |
Statements
On the computational complexity of (maximum) shift class scheduling (English)
0 references
15 September 1993
0 references
fixed job scheduling problem
0 references
aircraft maintenance
0 references
0 references
0.8964613
0 references
0.88337195
0 references
0.8833037
0 references
0.8768974
0 references
0.8761587
0 references
0.86442775
0 references
0.8628334
0 references
