Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:24, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduction of permutation flowshop problems to single machine problems using machine dominance relations |
scientific article |
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
