A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369)
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: A binary multiple knapsack model for single machine scheduling with machine unavailability |
scientific article; zbMATH DE number 6654172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A binary multiple knapsack model for single machine scheduling with machine unavailability |
scientific article; zbMATH DE number 6654172 |
Statements
A binary multiple knapsack model for single machine scheduling with machine unavailability (English)
0 references
17 November 2016
0 references
binary multiple knapsack
0 references
single machine scheduling
0 references
weighted number of tardy jobs
0 references
variable neighborhood search
0 references
machine maintenance
0 references
machine availability
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7908663153648376
0 references
0.7681502103805542
0 references
0.7426899075508118
0 references
0.7426847219467163
0 references
0.7387991547584534
0 references
