A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for minimizing the total completion time of a three-agent scheduling problem |
scientific article |
Statements
A lower bound for minimizing the total completion time of a three-agent scheduling problem (English)
0 references
7 September 2018
0 references
discrete optimization
0 references
job scheduling
0 references
multiple agents
0 references
maintenance activity
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0 references
0 references
