Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms (Q3196375)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6501909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms |
scientific article; zbMATH DE number 6501909 |
Statements
Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (English)
0 references
29 October 2015
0 references
approximation algorithm
0 references
combination of optimization problems
0 references
job shop
0 references
open shop
0 references
scheduling
0 references
shortest path
0 references
0.9737296104431152
0 references
0.9254106283187866
0 references
0.9082888960838318
0 references
0.8504950404167175
0 references
0.828694760799408
0 references
