By Topic

Scheduling job operations in an automatic assembly line

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

2 Author(s)
Shin, K.G. ; Dept. of Electr. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA ; Zin Zheng

The problem of scheduling job operations in an automatic assembly line used for manufacturing a small to medium volume of mixed workparts is addressed. An assembly line model is discussed. This model differs from the classical flow shop model in the following three aspects: there are no buffers at machine stations; constraints associated with the material transport system are included; and, for each batch of production, workparts are distinguished in groups, rather than individually. An optimal algorithm that requires very little computation is derived first by minimizing the total finish time for two machine assembly lines. This result is then generalized to the problem of scheduling an assembly line with m>2 machines processing single-operation jobs. In order to reduce the computational complexity of the latter problem, heuristic algorithms are proposed and shown to work quite well for all the cases considered. A heuristic solution to the problem of scheduling an assembly line with m>2 machines processing multioperation jobs is discussed

Published in:

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