Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time |
scientific article |
Statements
Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (English)
0 references
9 January 2007
0 references
scheduling
0 references
flow shop
0 references
discounted total weighed completion time
0 references
polynomial time algorithm
0 references
