Scheduling two chains of unit jobs on one machine: a polyhedral study (Q3100690)
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: Scheduling two chains of unit jobs on one machine: a polyhedral study |
scientific article; zbMATH DE number 5975596
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling two chains of unit jobs on one machine: a polyhedral study |
scientific article; zbMATH DE number 5975596 |
Statements
Scheduling two chains of unit jobs on one machine: A polyhedral study (English)
0 references
21 November 2011
0 references
one-machine scheduling
0 references
convex hull
0 references
facet-defining inequalities
0 references
0 references
0.8374037146568298
0 references
0.8178722858428955
0 references
0.7900711894035339
0 references
