Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2006.04.052 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2006.04.052 / rank | |||
Normal rank | |||
Latest revision as of 05:53, 10 December 2024
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
0 references
