Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6661447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints |
scientific article; zbMATH DE number 6661447 |
Statements
Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (English)
0 references
6 December 2016
0 references
single machine scheduling
0 references
availability constraint
0 references
learning effect
0 references
genetic algorithm
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8583579063415527
0 references
0.8420280814170837
0 references
0.8328368067741394
0 references
0.8266839385032654
0 references
