The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs.
Rubing ChenJinjiang YuanYuan GaoPublished in: J. Sched. (2019)
Keyphrases
- number of tardy jobs
- processing times
- flowshop
- scheduling problem
- multi agent systems
- multi agent
- single machine
- multiagent systems
- intelligent agents
- computational complexity
- mobile agents
- worst case
- completion times
- special case
- resource allocation
- scheduling algorithm
- query processing
- precedence constraints
- single machine scheduling problem