High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471)
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: High-multiplicity scheduling on one machine with forbidden start and completion times |
scientific article; zbMATH DE number 6653507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High-multiplicity scheduling on one machine with forbidden start and completion times |
scientific article; zbMATH DE number 6653507 |
Statements
High-multiplicity scheduling on one machine with forbidden start and completion times (English)
0 references
16 November 2016
0 references
scheduling
0 references
high-multiplicity
0 references
availability constraints
0 references
parameterized complexity
0 references
0 references
0.8694133758544922
0 references
0.8565900325775146
0 references
0.7814905643463135
0 references
0.7725717425346375
0 references
0.7645367383956909
0 references
