A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion (Q4689397)
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 6955001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion |
scientific article; zbMATH DE number 6955001 |
Statements
A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (English)
0 references
16 October 2018
0 references
scheduling
0 references
sum-of-processing-times-based learning
0 references
two-agent
0 references
tabu algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8874950408935547
0 references
0.8738692402839661
0 references
0.8522480726242065
0 references
0.8510376214981079
0 references
0.8394469618797302
0 references
