A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543)
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: A computational study of constraint satisfaction for multiple capacitated job shop scheduling |
scientific article; zbMATH DE number 1208478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study of constraint satisfaction for multiple capacitated job shop scheduling |
scientific article; zbMATH DE number 1208478 |
Statements
A computational study of constraint satisfaction for multiple capacitated job shop scheduling (English)
0 references
7 October 1998
0 references
multiple capacitated job shop scheduling
0 references
consistency checking
0 references
0 references
