Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00334-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994488876 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 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
