By Topic

Scheduling problems in connection with flexible production systems

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

1 Author(s)
P. J. Brucker ; Osnabruck Univ., Germany

The author discusses two scheduling problems derived from the area of flexible manufacturing. The first is a generalization of the classical job-shop problem in which there are machines equipped with different tools, which are able to process different types of operations. The second problem refers to batching. Algorithms and complexity results are presented for both classes of problems. In particular, an algorithm is developed that solves the batch-sizing problem for any batching problem with a given job sequence in O(n) time, where n is the number of jobs in the problem

Published in:

Robotics and Automation, 1991. Proceedings., 1991 IEEE International Conference on

Date of Conference:

9-11 Apr 1991