A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730)
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 569321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem |
scientific article; zbMATH DE number 569321 |
Statements
A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (English)
0 references
27 September 1995
0 references
release dates
0 references
two-machine flow shop
0 references
maximum completion time
0 references
makespan
0 references
polynomial approximation
0 references
greedy heuristic
0 references
0.9202645421028136
0 references
0.8577535152435303
0 references
0.8564957976341248
0 references
0.8561421036720276
0 references
0.8514022827148438
0 references
