An autonomous decentralized scheduling algorithm for a scheduling problem in a metal mould assembly process
This paper deals with a scheduling problem in a metal mould assembly process. The process is of job shop type with several additional constraints. One constraint is that precedence relations exist not only among operations but also among jobs. The other constraint is that the system has two types of machines in parallel. The single-function machine executes a specific operation of each job and the multi-function machine can execute several operations. Therefore selection of the machine is necessary for executing each operation. In addition the problem has two objective functions. One is to minimize the sum of the tardiness of each job, and the other is to maximize the working time of the multi-function machine because of reducing the operating cost of machines. An autonomous decentralized scheduling algorithm is proposed to obatin a compromise solution of the multi-objective problem. In this algorithm, a number of decision makers are called subsystems, which co-operate with one another in order to attain the goal of the overall system. In our algorithm, all jobs and the set of multi-function machine are defined as the subsystem because their objective functions are competitive. They determine the scheduling plan on the basis of their co-operation and the satisfaction of their own objective function levels. The effectiveness of the algorithm is investigated by examining numerical results.
scheduling algorithms metal mould assembly process job shop process autonomous decentralized algorithm multi-objective optimization