Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP (Q5481000)
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: Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP |
scientific article; zbMATH DE number 5044382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid MIP-CP techniques to solve a multi-machine assignment and scheduling problem in Xpress-CP |
scientific article; zbMATH DE number 5044382 |
Statements
7 August 2006
0 references
assignment
0 references
scheduling problem
0 references
0.8315067887306213
0 references
0.8192256689071655
0 references
0.7923497557640076
0 references
0.7884848117828369
0 references
0.7870086431503296
0 references
