Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time (Q2294263)
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: Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time |
scientific article; zbMATH DE number 7165749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time |
scientific article; zbMATH DE number 7165749 |
Statements
Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time (English)
0 references
10 February 2020
0 references
scheduling
0 references
flow shop
0 references
total weighted completion time
0 references
NP-hard
0 references
approximation algorithm
0 references
0 references
0.8643216490745544
0 references
0.8628551363945007
0 references
0.858190655708313
0 references
0.8378382921218872
0 references
0.8358091711997986
0 references
