Solving a two-agent single-machine scheduling problem considering learning effect (Q1762153)
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: Solving a two-agent single-machine scheduling problem considering learning effect |
scientific article; zbMATH DE number 6107594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a two-agent single-machine scheduling problem considering learning effect |
scientific article; zbMATH DE number 6107594 |
Statements
Solving a two-agent single-machine scheduling problem considering learning effect (English)
0 references
15 November 2012
0 references
scheduling
0 references
single-machine
0 references
two-agent
0 references
learning effect
0 references
genetic algorithm
0 references
0 references
0 references
0 references
0 references
0.9400293231010436
0 references
0.9230785965919496
0 references
0.8784542679786682
0 references
0.8738692402839661
0 references
0.8673869371414185
0 references
