By Topic

Deadlock-free schedules for automated manufacturing workstations

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$33 $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

2 Author(s)
S. E. Ramaswamy ; Dept. of Ind. & Manuf. Eng., Pennsylvania State Univ., University Park, PA, USA ; S. B. Joshi

Scheduling automated, unmanned manufacturing systems is significantly different from traditional job shops where human presence is implicitly assumed. Deadlocking has been identified as one of the critical problem in the control of automated manufacturing systems. Past approaches have been myopic in the sense that deadlock avoidance and recovery have been treated as run time problems of the system. In this paper, formulations for deadlock-free schedules are proposed and the importance of considering both material handling and buffer space availability while scheduling such an automated workstation are discussed. Extensions to the basic model and solution methods are also presented

Published in:

IEEE Transactions on Robotics and Automation  (Volume:12 ,  Issue: 3 )