A Single-Machine Two-Agent Scheduling Problem by a Branch-and-Bound and Three Simulated Annealing Algorithms
In the field of distributed decision making, different agents share a common processing resource, and each agent wants to minimize a cost function depending on its jobs only.These issues arise in different application contexts, including real-time systems, integrated service networks, industrial districts, and telecommunication systems.Motivated by