A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/moor.19.1.68 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/MOOR.19.1.68 / rank | |||
Normal rank | |||
Latest revision as of 16:21, 29 December 2024
scientific article; zbMATH DE number 569321
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
