A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem (Q4294730): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.19.1.68 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981637794 / rank | |||
Normal rank | |||
Revision as of 00:33, 20 March 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
