Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans.
Jinjiang YuanPublished in: J. Comb. Optim. (2017)
Keyphrases
- single machine
- number of tardy jobs
- fixed number
- weighted sum
- completion times
- multiple agents
- minimize total
- scheduling problem
- processing times
- single machine scheduling problem
- identical parallel machines
- release dates
- maximum tardiness
- job processing times
- maximum lateness
- release times
- sequence dependent setup times
- bicriteria
- scheduling jobs
- linear combination
- flowshop
- identical machines
- setup times
- dynamic programming
- finite number
- reinforcement learning
- tabu search
- resource allocation