Scheduling dedicated jobs with variative processing times (Q5963650)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6544338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling dedicated jobs with variative processing times |
scientific article; zbMATH DE number 6544338 |
Statements
Scheduling dedicated jobs with variative processing times (English)
0 references
23 February 2016
0 references
bipartite graph
0 references
maximal matching
0 references
NP-hardness
0 references
integer linear programming
0 references
rail-rail yard
0 references
0.8138279318809509
0 references
0.7904609441757202
0 references
0.7863264679908752
0 references
