By Topic

Geometric approach and taboo search for scheduling flexible manufacturing systems

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

3 Author(s)
Mati, Y. ; INRIA, Metz, France ; Rezg, N. ; Xiaolan Xie

This paper addresses the scheduling and deadlock avoidance of a class of automated manufacturing systems. In such systems, a set of jobs is to be performed on a set of resources and each job requires several operations. An operation may require several types of resources with several units of each type. Further, upon the completion of an operation, its related resources cannot be released until resources needed for the next operation become available. One important characteristic of such systems is the possibility of deadlock. The scheduling problem deals with the allocation of resources such that jobs are completed within a minimal makespan and deadlocks are avoided. We extend the classical geometric approach to solve the two-job case of our model. A greedy algorithm based on this result and the taboo search heuristic are then developed for the general case. Numerical results show that the proposed algorithm is fast and provides good schedules

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:17 ,  Issue: 6 )