Autonomous Decentralized Scheduling Algorithm for a Job-Shop Scheduling Problem with Complicated Constraints

  • Authors:
  • H. Iima;T. Hara;N. Ichimi;N. Sannomiya

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ISADS '99 Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with a job-shop scheduling problem with complicated constraints. In this problem precedence relations exist not only among operations but also among jobs. The system has several types of single function machines and a type of multi-function machine. Furthermore, the number of machines belonging to each type is not single but plural. Therefore selection of the machine is necessary for executing each operation. In addition the problem has a multiobjective function. An autonomous decentralized scheduling algorithm is proposed to obtain a suboptimal solution of this problem. In this algorithm, a number of decision makers called subsystems 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 satisfaction of their own objective function levels. 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.