Modeling and solving open shop cooperative task scheduling problems based on satisfiability modulo theories (Q4645451)
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: Modeling and solving open shop cooperative task scheduling problems based on satisfiability modulo theories |
scientific article; zbMATH DE number 6999732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Modeling and solving open shop cooperative task scheduling problems based on satisfiability modulo theories |
scientific article; zbMATH DE number 6999732 |
Statements
10 January 2019
0 references
scheduling
0 references
open shop scheduling problem
0 references
satisfiability modulo theories
0 references
minimum makespan
0 references
mixed 0-1 integer programming
0 references
0.7319921255111694
0 references
0.7272050976753235
0 references
0.7137089967727661
0 references
0.7093002200126648
0 references
