Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201)
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: Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time |
scientific article; zbMATH DE number 5083746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time |
scientific article; zbMATH DE number 5083746 |
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
0 references
0.8910084366798401
0 references
0.8886098861694336
0 references
0.8886098861694336
0 references
0.8792874813079834
0 references
0.8792874813079834
0 references
