Pareto-scheduling of two competing agents with their own equal processing times.
Rubing ChenZhichao GengLingfa LuJinjiang YuanYuan ZhangPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- processing times
- scheduling problem
- scheduling jobs
- release dates
- identical machines
- single machine
- precedence relations
- identical parallel machines
- setup times
- number of tardy jobs
- multiple agents
- release times
- scheduling decisions
- flowshop
- single machine scheduling problem
- resource allocation
- resource consumption
- communication delays
- multi objective
- job processing times
- makespan minimization
- precedence constraints
- worst case performance ratio
- earliness tardiness
- total weighted tardiness
- np hard
- sequence dependent setup times
- polynomially solvable
- parallel machines
- completion times
- manufacturing cell
- tabu search
- competitive ratio
- job shop
- assembly line
- evolutionary algorithm
- special case
- steady state
- job shop scheduling problem
- multiple objectives
- differential evolution