Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085)
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: Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences |
scientific article; zbMATH DE number 5727502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences |
scientific article; zbMATH DE number 5727502 |
Statements
Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (English)
0 references
28 June 2010
0 references
single machine scheduling
0 references
bi-criteria problem
0 references
learning effect
0 references
non-dominated solution
0 references
0 references
0 references
0 references
0.8503146767616272
0 references
0.8501881957054138
0 references
0.803875744342804
0 references
0.7950057983398438
0 references
