Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs.
Danny HermelinJudith-Madeleine KubitzaDvir ShabtayNimrod TalmonGerhard J. WoegingerPublished in: IPEC (2015)
Keyphrases
- significantly fewer
- multi agent systems
- multi agent
- multiple agents
- multiagent systems
- autonomous agents
- intelligent agents
- software agents
- parallel machines
- agent systems
- agent architecture
- job scheduling
- interacting agents
- agent model
- inter agent
- artificial agents
- agent technology
- single agent
- identical machines
- mobile agents
- minimize total
- scheduling problem
- identical parallel machines
- release dates
- scheduling strategy
- processing times
- unrelated parallel machines
- optimal scheduling
- scheduling jobs
- agents and data mining
- cooperating agents
- single machine
- cognitive agents
- heterogeneous agents
- release times
- action selection
- deteriorating jobs
- agent receives
- resource bounded
- communicating agents
- agent behavior
- interface agent
- cooperative agents
- distributed agents
- agent environment
- agent oriented
- wafer fabrication
- cooperative
- precedence constraints
- social welfare
- maximum lateness
- learning agents
- scheduling policies
- virtual agents
- computational grids
- scheduling algorithm
- bdi agents
- reinforcement learning
- dynamic environments
- resource allocation
- reasoning process
- single machine scheduling problem
- negotiation protocol
- decision making
- flowshop
- learning agent
- agent interactions
- completion times
- decision theoretic
- minority game
- electronic marketplaces
- trading agents
- rational agents
- coalition formation
- robocup soccer
- batch processing
- agent communication
- agent programming
- batch processing machines
- belief desire intention
- reward function
- coordination mechanism
- real time strategy games