Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.amc.2006.04.052 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045611123 / rank | |||
Normal rank | |||
Revision as of 03:04, 20 March 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
