A variant of the permutation flow shop model with variable processing times (Q1363747): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:52, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A variant of the permutation flow shop model with variable processing times |
scientific article |
Statements
A variant of the permutation flow shop model with variable processing times (English)
0 references
24 February 1998
0 references
makespan minimization
0 references
variable processing times
0 references
flow shop
0 references
infinite buffer capacities
0 references
greedy placement algorithm
0 references
