A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-009-0150-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-009-0150-8 / rank | |||
Normal rank | |||
Latest revision as of 01:02, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for a flow-shop batching problem with equal-length operations |
scientific article |
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
