A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253)
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: A polynomial-time algorithm for a flow-shop batching problem with equal-length operations |
scientific article; zbMATH DE number 5997878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for a flow-shop batching problem with equal-length operations |
scientific article; zbMATH DE number 5997878 |
Statements
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (English)
0 references
16 January 2012
0 references
batch scheduling
0 references
flow shop
0 references
polynomial-time algorithm
0 references
0.8513792157173157
0 references
0.8503605723381042
0 references
0.819669246673584
0 references
0.8034124374389648
0 references
0.8027418851852417
0 references
