A lower bound for minimizing the total completion time of a three-agent scheduling problem (Q1671716)
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: A lower bound for minimizing the total completion time of a three-agent scheduling problem |
scientific article; zbMATH DE number 6933797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for minimizing the total completion time of a three-agent scheduling problem |
scientific article; zbMATH DE number 6933797 |
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
