By Topic

Heuristic scheduling algorithm for flexible manufacturing systems with partially overlapping machine capabilities

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
$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

3 Author(s)
Chun Wang ; Dept. of Electr. & Comput. Eng., Western Ontario Univ., London, Ont., Canada ; Ghenniwa, H. ; Weiming Shen

This paper presents a new heuristic scheduling algorithm for flexible manufacturing systems (FMSs) with partially overlapping machine capabilities. Unlike traditional 'routing then sequencing' methods, the algorithm solves routing and sequencing sub-problems of FMS scheduling simultaneously by combining several dispatching rules. The primary objective is to take advantage of the system flexibility provided by partially overlapping machine capabilities and various processing speeds associated with different machines in FMS. Simulation results show that for the class of FMS scheduling problems modeled in this paper, the algorithm generate valid schedules and improve solution quality at an average of 30% compared to a variation of the longest processing time first (LPT) rule.

Published in:

Mechatronics and Automation, 2005 IEEE International Conference  (Volume:3 )

Date of Conference:

2005