Two-Machine Super-Shop Scheduling Problem (Q3978740): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1057/jors.1991.96 / rank | |||
| Property / author | |||
| Property / author: Vitaly A. Strusevich / rank | |||
| Property / author | |||
| Property / author: Vitaly A. Strusevich / rank | |||
Normal rank | |||
| 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.1057/jors.1991.96 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037726054 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1057/JORS.1991.96 / rank | |||
Normal rank | |||
Latest revision as of 20:01, 28 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-Machine Super-Shop Scheduling Problem |
scientific article |
Statements
Two-Machine Super-Shop Scheduling Problem (English)
0 references
25 June 1992
0 references
two-machine super-shop
0 references
flow-shop
0 references
job-shop
0 references
open-shop
0 references
mixed-shop
0 references
polynomial algorithm
0 references
makespan
0 references
