Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Pareto-optima for the total and maximum tardiness single machine problem |
scientific article |
Statements
Finding the Pareto-optima for the total and maximum tardiness single machine problem (English)
0 references
2 December 2002
0 references
total and maximum tardiness
0 references
\(\varepsilon\)-constraint approach
0 references
Pareto-optima
0 references
branch-and-bound algorithm
0 references
