Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Branch and Bound Algorithm for the Order Optimization of Parallel Activities in Project Scheduling

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

2 Author(s)
Xing-mei Li ; Sch. of Bus. Manage., North China Electr. Power Univ., Beijing ; Su-Fang Zhang

In order to solve the problem of four parallel activities being adjusted to an order chain of three activities and a parallel activity in deterministic activity-on-arc networks of the CPM type, a new theorem and the comparative method of special order chains of three activities are proposed. Based on the theorem and method, a branch and bound algorithm of the decision tree is described. Through the example, the algorithm minimizes the computational effort in enumerating alternative modes.

Published in:

Risk Management & Engineering Management, 2008. ICRMEM '08. International Conference on

Date of Conference:

4-6 Nov. 2008