Minimizing the sum of the total completion time and batching costs on a batch processing machine (Q2916934)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6091352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the sum of the total completion time and batching costs on a batch processing machine |
scientific article; zbMATH DE number 6091352 |
Statements
5 October 2012
0 references
single machine
0 references
parallel batch
0 references
total completion time
0 references
batching cost
0 references
dynamic programming
0 references
Minimizing the sum of the total completion time and batching costs on a batch processing machine (English)
0 references
0.8957666158676147
0 references
0.8667352795600891
0 references
0.8623855710029602
0 references
