By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Iima, H. ; Kyoto Inst. of Technol., Japan ; Hara, T. ; Ichimi, N. ; Sannomiya, N.

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

Published in:

Autonomous Decentralized Systems, 1999. Integration of Heterogeneous Systems. Proceedings. The Fourth International Symposium on

Date of Conference: