Abstract
This paper deals with a scheduling problem for a large scale job-shop process. This problem has complicated constraints such as the precedence conditions among jobs, the existence of parallel machines and multi-function machines, and the working hours. For solving this problem, we propose an autonomous decentralized scheduling algorithm in which the schedule of each operation is determined backwards. In this algorithm, a number of decision makers called modules cooperate with one another in order to attain the goal of the overall system. They determine the scheduling plan on the basis of their cooperation and the sat-isfaction of their own objective function levels. Furthermore, a priority rule is proposed for the case where a product is given priority. The effectiveness of the proposed algorithm is examined through the computational result and the evaluation from a production manager in the job site.
