A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q59902867, #quickstatements; #temporary_batch_1711486624475 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59902867 / rank | |||
Normal rank | |||
Revision as of 22:03, 26 March 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
