Minimizing the number of late jobs when the start time of the machine is variable (Q1758276)
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: Minimizing the number of late jobs when the start time of the machine is variable |
scientific article; zbMATH DE number 6103789
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late jobs when the start time of the machine is variable |
scientific article; zbMATH DE number 6103789 |
Statements
Minimizing the number of late jobs when the start time of the machine is variable (English)
0 references
8 November 2012
0 references
single machine scheduling
0 references
number of late jobs
0 references
Pareto optimal points
0 references
\(\epsilon \)-constraint approach
0 references
0 references
0 references
0.8391139507293701
0 references
0.8177704215049744
0 references
0.8107448220252991
0 references
0.8021838068962097
0 references
