By Topic

A New Polynomial Algorithm for Total Tardiness Minimization of the Sequencing Optimal Problem of Parallel Activities

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)
Li Xingmei ; Sch. of Bus. Manage., North China Electr. Power Univ., Beijing, China ; Zhang Zhaoqing ; Qi Jianxun

The problem of M activities of N > M parallel activities being adjusted to a procedure chain is one type of the project scheduling. In allusion to M = 3 , a new polynomial algorithm is proposed to minimize the total tardiness criterion. In order to present this algorithm, and search the optimal procedure chain, we propose a Normal Chain Theory by virtue of the relationships of activities' time parameters, together with the properties that the optimal chain contains the activities with the minimum of earliest finish time. By the analysis of this algorithm, we get the time complexity is O(N log N).

Published in:

Management and Service Science, 2009. MASS '09. International Conference on

Date of Conference:

20-22 Sept. 2009