Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks (Q3003281)
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: Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks |
scientific article; zbMATH DE number 5900035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks |
scientific article; zbMATH DE number 5900035 |
Statements
Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks (English)
0 references
26 May 2011
0 references
Hybrid flow shop scheduling
0 references
Multiprocessor tasks
0 references
Discrepancy search
0 references
0.87370235
0 references
0.8721074
0 references
0.8636546
0 references
0.86036396
0 references
0.86007077
0 references
0.8463985
0 references
0.8448738
0 references
