Autonomous decentralized scheduling algorithm for a job-shop scheduling problem with complicated constraints

This paper deals with a job-shop scheduling problem with complicated constraints. In the problem precedence relations exist nor only among operations but also among jobs. Furthermore, this production system has several types of single function machines and a type of multifunction machine, and the number of machines available is plural for the respective types. Therefore selection of the machine is necessary for executing each operation. An autonomous decentralized scheduling algorithm is proposed to obtain a suboptimal solution of this problem. The effectiveness of the proposed algorithm is investigated by examining numerical results. Moreover, the algorithm is also applied to a rescheduling problem in the case where a machine breaks down