Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
