This paper deals with a job shop scheduling problem with a multi-function machine. In this problem, the multi-function machine can process all operations, and each operation is processed by either a single-function machine or the multi-function machine. This 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 ma-chine because of the operating cost of machines. An autonomous decentralized scheduling algorithm is pro-posed to obtain a compromise solution of this problem. In this algorithm, a number of decision makers are called subsystems which cooperate with one another in order to attain the goal of the overall system. In our algorithm, all jobs and the multi-function machine are defined as the subsystems because their objective func-tions are competitive. They determine the scheduling plan on the basis of their cooperation and their own objective functions. The effectiveness of the algorithm is investigated by examining numerical results.