Scheduling problems with two competing agents to minimized weighted earliness-tardiness.
Enrique GerstlGur MosheiovPublished in: Comput. Oper. Res. (2013)
Keyphrases
- earliness tardiness
- scheduling problem
- single machine
- processing times
- multi agent systems
- parallel machines
- multi agent
- single machine scheduling problem
- distributed constraint optimization problems
- np hard
- flowshop
- release dates
- tabu search
- distributed constraint satisfaction problems
- decision making
- precedence constraints
- resource allocation
- special case
- search algorithm