A lower bound for minimizing the total completion time of a three-agent scheduling problem.
Yau-Ren ShiauWen-Chiung LeeYu-Sheng KungJen-Ya WangPublished in: Inf. Sci. (2016)
Keyphrases
- lower bound
- scheduling problem
- completion times
- np hard
- sum of completion times
- upper bound
- single machine
- competitive ratio
- branch and bound algorithm
- flowshop
- multi agent
- strongly np hard
- multi agent systems
- optimal solution
- branch and bound
- objective function
- single machine scheduling problem
- processing times
- autonomous agents
- tabu search
- multiagent systems
- worst case
- agent model
- decision making
- precedence constraints
- weighted sum
- dynamic environments
- intelligent agents
- permutation flowshop
- setup times
- software agents
- agent architecture
- lower and upper bounds
- approximation algorithms
- randomly generated test problems
- search algorithm for solving
- minimizing makespan
- mobile agents
- linear programming
- integer programming
- multiple agents
- linear programming relaxation
- lower bounding
- computational complexity
- sequence dependent setup times
- cooperative
- metaheuristic
- action selection
- parallel machines
- constraint satisfaction problems