A computational study of constraint satisfaction for multiple capacitated job shop scheduling (Q1266543): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00354-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168328014 / rank | |||
Normal rank | |||
Revision as of 21:04, 19 March 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
