Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025)
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: Reduction of permutation flowshop problems to single machine problems using machine dominance relations |
scientific article; zbMATH DE number 6901265
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduction of permutation flowshop problems to single machine problems using machine dominance relations |
scientific article; zbMATH DE number 6901265 |
Statements
Reduction of permutation flowshop problems to single machine problems using machine dominance relations (English)
0 references
11 July 2018
0 references
scheduling
0 references
flowshop
0 references
processing times
0 references
PFSP
0 references
makespan
0 references
flowtime
0 references
single machine
0 references
dominating machine
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
