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 this page instead for the normal view: Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms |
scientific article |
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
