Scheduling two agents on uniform parallel machines with makespan and cost functions.
Donatas ElvikisHorst W. HamacherVincent T'kindtPublished in: J. Sched. (2011)
Keyphrases
- scheduling problem
- cost function
- multi agent systems
- batch processing
- release dates
- resource allocation
- multi agent
- scheduling jobs
- autonomous agents
- multiagent systems
- resource allocation and scheduling
- single machine
- intelligent agents
- batch processing machines
- multiple agents
- unrelated parallel machines
- software agents
- processing times
- cooperative
- artificial agents
- flowshop
- precedence constraints
- mobile agents
- scheduling algorithm
- search space reduction
- deteriorating jobs
- social welfare
- agent technology
- minimizing makespan
- round robin
- setup times
- allocate resources
- agent model
- incomplete information
- lower bound
- decision making
- dynamic environments
- distributed constraint optimization problems
- response time
- agent systems
- coalition formation
- parallel machines
- distributed constraint optimization
- job shop scheduling
- utility function