A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:23, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A DP algorithm for minimizing makespan and total completion time on a series-batching machine |
scientific article |
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
