Consensus-based Approach to Distributed Scheduling Problem

Abstract

direction method of for to and show that the job shop scheduling problem (JSP) can be formulated by the proposed method. In distributed optimization, the optimization of is repeated until the convergence condition is but the scheduling problem is nonconvex optimization problem, the convergence by the proposed method is not guaranteed. In some a large number of iterations may be required to satisfy the convergence condition. In this paper, we propose two schemes to obtain a feasible solution within a smaller number of iterations. Then, the method is evaluated by computer experiments using benchmark instances of JSP.