Cart (Loading....) | Create Account
Close category search window
 

Optimal Scheduling for Load Balance of Two-Machine Production Lines

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)

A scheduling method for balancing work loads between a machine and the one succeeding it in a two-machine production line so as to maximize the overall production speed is proposed in this paper. The case where the production speeds are different from each other both for machines and for commodities is treated. The objective is to minimize the changeover loss under the constraints that 1) the due date must be met, 2) the queue length of commodity items must be shorter than the maximum space between the two machines, and 3) no idle time is acceptable for either machine. Both the lot size of each commodity for each production period and their production sequence is determined by the proposed method. The scheduling algorithm is a branch-and-bound procedure. In the conventional flow shop scheduling problem, the lot size of each commodity is given beforehand considering the inventory loss of the final products and the changeover loss of the production line. Only the flow sequence is determined there. Therefore, it can not perfectly balance the work loads between machines. Computational experience with the proposed method indicates that it is capable of solving problems involving 20 commodities over a planning horizon of 300 time periods. These are practical scheduling problems with a planning horizon of one week for a home appliance production line. These computation times are below one minute (using the HITAC M-180 operating at three million instructions per second (MIPS)).

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:11 ,  Issue: 6 )

Date of Publication:

June 1981

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.