Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768)
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: Using mixed graph coloring to minimize total completion time in job shop scheduling |
scientific article; zbMATH DE number 5115385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using mixed graph coloring to minimize total completion time in job shop scheduling |
scientific article; zbMATH DE number 5115385 |
Statements
Using mixed graph coloring to minimize total completion time in job shop scheduling (English)
0 references
11 January 2007
0 references
scheduling
0 references
job shop
0 references
total completion time
0 references
mixed graph coloring
0 references
branch and bound
0 references
0.8362305760383606
0 references
0.8322501182556152
0 references
0.821766197681427
0 references
