Scheduling a single server and equal processing times in a two-machine flow-shop (Q2858858)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling a single server and equal processing times in a two-machine flow-shop |
scientific article; zbMATH DE number 6229960
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling a single server and equal processing times in a two-machine flow-shop |
scientific article; zbMATH DE number 6229960 |
Statements
19 November 2013
0 references
two-machine
0 references
flow-shop
0 references
single server
0 references
complexity
0 references
\(NP\)-hardness
0 references
worst-case analysis
0 references
Scheduling a single server and equal processing times in a two-machine flow-shop (English)
0 references
