On the computational complexity of (maximum) class scheduling (Q1179005)
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) class scheduling |
scientific article; zbMATH DE number 23681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of (maximum) class scheduling |
scientific article; zbMATH DE number 23681 |
Statements
On the computational complexity of (maximum) class scheduling (English)
0 references
26 June 1992
0 references
Fixed Job Scheduling Problem
0 references
aircraft maintenance process
0 references
non- preemptive
0 references
0.9512521028518676
0 references
0.8878886103630066
0 references
0.8740208745002747
0 references
0.7907441258430481
0 references
