A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151)
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 note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times |
scientific article; zbMATH DE number 2091656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times |
scientific article; zbMATH DE number 2091656 |
Statements
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (English)
0 references
16 August 2004
0 references
Scheduling
0 references
Precedence constraints
0 references
Batches
0 references
0.9526277184486388
0 references
0.8942462801933289
0 references
0.8383753895759583
0 references
0.835446834564209
0 references
