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

Scheduling Multiple Concurrent Projects Using Shared Resources with Allocation Costs and Technical Constraints

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

1 Author(s)
Katsavounis, S. ; Dept. of Production Eng. & Manage. Sch. of Eng., Demokritos Univ. of Thrace, Xanthi

Resource constraint multiple project scheduling problem (RCMPSP), as a generalization of the resource constraint project scheduling problem (RCPSP), involves the scheduling of the activities of multiple separate projects, subject to precedence and shared resource constraints. RCMPSP is a NP-hard optimization problem having many applications in large scale construction, corporate wide logistics and manufacturing project management. The most common efficient heuristics in literature solve the problem using priority rules to allocate the activities and taking into account realistic assumptions to minimize the projects delays and the tardiness penalties. The single pass parallel heuristic approach presented in this paper introduces two cardinal restrictions related to renewable resources, pertain to non-negligible resource transfer overheads among the projects and the feasibility of such movements, due to technical constraints, during time periods. Using realistic assumptions for all the constituent elements of the RCMPSP finds the effect of the above constraints to the total project delay applying two well-known time-based single priority rules, dynamic earliest starting time (EST) and latest starting time (LST). Each independent project is formulated using a vertex and arc weighted directed acyclic graph. Depending on the usage of shareable resources activities belong to two mutually excluded types. The paper ends with a small detailed numerical example.

Published in:

Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on

Date of Conference:

7-11 April 2008

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.