An efficient ILP formulation for the single machine scheduling problem (Q5189883)
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 5680415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient ILP formulation for the single machine scheduling problem |
scientific article; zbMATH DE number 5680415 |
Statements
An efficient ILP formulation for the single machine scheduling problem (English)
0 references
11 March 2010
0 references
single machine scheduling
0 references
integer linear programming
0 references
dominance conditions
0 references
0 references
0 references
0 references
0.8272269368171692
0 references
0.8178407549858093
0 references
0.8120285868644714
0 references
0.8001942038536072
0 references
0.7935430407524109
0 references
