Distributed Job Shop Scheduling using Consensus Alternating Direction Method of Multipliers

摘要

Scheduling problems belong to NP-hard and are not easily solved in large systems. In recent years, the development of optimization methods in multi-agent systems has been remarkable. In this paper, we consider a large-scale system as a multi-agent system and discuss a method of solving a scheduling problem using consensus among agents. We propose a distributed method using the alternating direction method of multipliers and evaluate the method using a small-scale instance of the scheduling problem.