Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time (Q4732296)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4118144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time |
scientific article; zbMATH DE number 4118144 |
Statements
Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time (English)
0 references
1989
0 references
minimum finish-time schedule
0 references
two-machine flow-shop
0 references
NP-hard
0 references
heuristic
0 references
worst-case bounds
0 references
0.91901004
0 references
0.91649896
0 references
0.91470546
0 references
0.9088386
0 references
0.90645975
0 references
0.9062128
0 references
0.9055686
0 references
0.9024725
0 references
0 references
