A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005936117 / rank | |||
Normal rank | |||
Revision as of 00:46, 20 March 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
