Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:00, 3 February 2024
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