Two-Machine Super-Shop Scheduling Problem (Q3978740): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:22, 29 January 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
