A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (Q2489279): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2005.01.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075050211 / rank | |||
Normal rank | |||
Revision as of 19:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint |
scientific article |
Statements
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint (English)
0 references
16 May 2006
0 references
Approximation algorithms
0 references
Flow shop scheduling
0 references
Availability constraints
0 references
