High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6653507 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
high-multiplicity | |||
| Property / zbMATH Keywords: high-multiplicity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
availability constraints | |||
| Property / zbMATH Keywords: availability constraints / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
parameterized complexity | |||
| Property / zbMATH Keywords: parameterized complexity / rank | |||
Normal rank | |||
Revision as of 07:17, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | High-multiplicity scheduling on one machine with forbidden start and completion times |
scientific article |
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
