Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work.
Ruyan HeJinjiang YuanC. T. NgT. C. E. ChengPublished in: J. Comb. Optim. (2021)
Keyphrases
- number of tardy jobs
- single machine
- job processing times
- processing times
- completion times
- scheduling problem
- release dates
- single machine scheduling problem
- flowshop
- multi agent systems
- multiagent systems
- competitive ratio
- multi agent
- multi objective
- mobile agents
- dynamic programming
- np hard
- scheduling algorithm
- precedence constraints
- particle swarm optimization
- parallel machines
- cost function