By Topic

New approximation algorithms for two-machine flow shop total completion time problem

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)
Danyu Bai ; Sch. of Econ. & Manage., Shenyang Univ. of Chem. Technol., Shenyang, China ; Tao Ren ; Hongmei Li

This paper considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2||ΣCj and F2|rj|ΣCj respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee are provided for problems F2||ΣCj and F2|rj|ΣCj, respectively. At the end of the paper, a series of simulation experiments are conducted to show the effectiveness of the new heuristics.

Published in:

Intelligent Control and Automation (WCICA), 2012 10th World Congress on

Date of Conference:

6-8 July 2012