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

A flowshop scheduling algorithm to minimize total weighted completion time

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)
Chuanli Zhao ; Coll. of Sci., Northeastern Univ., Shenyang, China ; QingLing Zhang ; Hengyong Tang

The paper considers the problem of minimizing total weighted completion time in a flowshop. A heuristic algorithm with worst-case bound m is given. For m = 2, if jobs have agreeable weights i.e. where pi ≤ pj implies wi ≥ wj, (i, j = 1, 2, ···, n). The worst-case bound is 2β/α+β, where α and β denote the minimum and maximum processing time of all operations. For some special cases, the polynomial algorithms are given.

Published in:

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

Date of Conference:

2002

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.