By Topic

Solving nonstandard job-shop scheduling problem by loading balance of machines scheduling algorithm

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

4 Author(s)
Wang Fengru ; Bus. Coll., Harbin Commercial Univ., China ; Wang Zhiqiang ; Yang Shuwen ; Chen Dongxue

For the nonstandard job-shop scheduling problem (NJSSP) in which some operations are processed on several identical machines, we built the objective function of machine load balancing of a nonstandard scheduling algorithm. Through complexity analysis of operation processes, the algorithm has lower complexity. Experiments indicated that the scheduling result of the algorithm compares with other methods.

Published in:

Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on  (Volume:3 )

Date of Conference:

2002