A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10951-009-0150-8 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/scheduling/BruckerS11a / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10951-009-0150-8 / rank | |||
Normal rank | |||
Latest revision as of 00: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
