Depth-first heuristic search for the job shop scheduling problem (Q363574): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6203945 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
heuristic search | |||
Property / zbMATH Keywords: heuristic search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
depth-first search | |||
Property / zbMATH Keywords: depth-first search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constraint propagation | |||
Property / zbMATH Keywords: constraint propagation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank |
Revision as of 12:09, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Depth-first heuristic search for the job shop scheduling problem |
scientific article |
Statements
Depth-first heuristic search for the job shop scheduling problem (English)
0 references
3 September 2013
0 references
heuristic search
0 references
depth-first search
0 references
constraint propagation
0 references
scheduling
0 references