A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090)
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: A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing |
scientific article; zbMATH DE number 7443701
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing |
scientific article; zbMATH DE number 7443701 |
Statements
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (English)
0 references
13 December 2021
0 references
open shop
0 references
problems with transportation delays
0 references
routing open shop
0 references
unrelated travel times
0 references
variable depot
0 references
polynomially solvable subcases
0 references
0 references
0 references
0 references
0 references
0 references
