By Topic

A new approach to multi-pass scheduling in shop floor control

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)
Taejong Yoo ; Dept. of Ind. Eng., Pohang Univ. of Sci. & Technol., South Korea ; Daehong Kim ; Hyunbo Cho

Real-time planning and scheduling in a shop floor are not easy to accomplish due to the concurrent flow of various parts as well as sharing of different types of resources. Multi-pass scheduling is a well-known method for solving the aforementioned problem. Its success depends largely on selecting the best decision-making rule fast and effectively. Although many efforts have been made in the past, a way to minimize the computational load of rule evaluation and selection has yet to appear. The objective of the paper is to apply a nested partitioning (NP) method and an optimal computing budget allocation (OCBA) method to reduce the computational load without the loss of the performance of multi-pass scheduling. The experimental design and analysis was performed to validate that NP and OCBA can be successfully applied to multi-pass scheduling in order to enhance the performance of multi-pass scheduling.

Published in:

Simulation Conference, 2004. Proceedings of the 2004 Winter  (Volume:2 )

Date of Conference:

5-8 Dec. 2004