Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999)
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: Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models |
scientific article; zbMATH DE number 6650658
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models |
scientific article; zbMATH DE number 6650658 |
Statements
Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (English)
0 references
10 November 2016
0 references
scheduling
0 references
learning
0 references
deteriorating
0 references
aging
0 references
dynamic programming
0 references
parallel algorithm
0 references
0 references
0 references
0 references
