Polynomial time approximation schemes for general multiprocessor job shop scheduling (Q4806605): Difference between revisions
From MaRDI portal
Changed an 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.1016/s0196-6774(02)00248-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071008186 / rank | |||
Normal rank | |||
Latest revision as of 10:12, 30 July 2024
scientific article; zbMATH DE number 1910770
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time approximation schemes for general multiprocessor job shop scheduling |
scientific article; zbMATH DE number 1910770 |
Statements
Polynomial time approximation schemes for general multiprocessor job shop scheduling (English)
0 references
14 May 2003
0 references
