A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835)
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 DP algorithm for minimizing makespan and total completion time on a series-batching machine |
scientific article; zbMATH DE number 5771271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A DP algorithm for minimizing makespan and total completion time on a series-batching machine |
scientific article; zbMATH DE number 5771271 |
Statements
A DP algorithm for minimizing makespan and total completion time on a series-batching machine (English)
0 references
16 August 2010
0 references
multicriteria scheduling
0 references
series-batching machine
0 references
makespan
0 references
total completion time
0 references
Pareto optimal solutions
0 references
computational complexity
0 references
0 references
0.9109300971031188
0 references
0.9037936329841614
0 references
0.8875479102134705
0 references
0.8833596706390381
0 references
0.8736729621887207
0 references
