Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties.
Yunqiang YinShuenn-Ren ChengChin-Chia WuPublished in: Inf. Sci. (2012)
Keyphrases
- scheduling problem
- single machine
- multi agent systems
- processing times
- np hard
- multi agent
- intelligent agents
- parallel machines
- precedence constraints
- distributed constraint optimization problems
- autonomous agents
- tardiness cost
- completion times
- multiple agents
- flowshop
- multiagent systems
- setup times
- software agents
- tabu search
- cooperative
- job shop scheduling problem
- job shop scheduling
- sequence dependent setup times
- resource allocation
- greedy heuristics
- decision making
- distributed constraint satisfaction problems
- minimizing makespan
- tardiness penalties
- agent model
- coalition formation
- agent architecture
- mobile agents
- dynamic environments
- release dates
- job shop
- linear programming
- deteriorating jobs
- dynamic programming
- single machine scheduling problem
- total weighted tardiness
- single machine scheduling
- search algorithm