A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075)
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 algorithm for lot-size scheduling of two type tasks. |
scientific article; zbMATH DE number 1856414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for lot-size scheduling of two type tasks. |
scientific article; zbMATH DE number 1856414 |
Statements
A polynomial algorithm for lot-size scheduling of two type tasks. (English)
0 references
21 January 2003
0 references
Algorithms
0 references
Lot-size scheduling
0 references
Parallel machines
0 references
0 references
0 references
0 references
