Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost.
Long WanJinjiang YuanLijun WeiPublished in: Appl. Math. Comput. (2016)
Keyphrases
- number of tardy jobs
- processing times
- single machine scheduling problem
- single machine
- multiple objectives
- multi agent
- multi agent systems
- resource consumption
- multi objective
- scheduling problem
- resource allocation
- flowshop
- tardiness cost
- pareto optimal
- multiagent systems
- optimization algorithm
- multiobjective optimization
- scheduling algorithm
- optimization problems
- total cost
- evolutionary algorithm