A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:38, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study of constraint satisfaction for multiple capacitated job shop scheduling |
scientific article |
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
