By Topic

Brute Force Method for Lot Streaming in FMS Scheduling Problems

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

1 Author(s)
Kodeekha, E. ; Budapest Univ. of Technol. & Econ., Budapest

Minimization of maximum production time (Makespan) in Flexible Manufacturing Systems (FMS) scheduling problems is an important objective and may result in good system performances. To realize a makespan close to the global minimum production time is a suitable goal for scheduling But answering the question how close this goal can be approached is a very complicated problem. In this paper bottleneck scheduling and Lot Streaming (LS) are used for a Job shop Scheduling Problem (JSP). The new contribution of the paper is applying a Brute Force Method (BFM) to LS. The effect of setup times is considered and numerical example is given.

Published in:

Intelligent Engineering Systems, 2007. INES 2007. 11th International Conference on

Date of Conference:

June 29 2007-July 2 2007