Research Article  Open Access
Analysis of an Anomaly: The Increase in Time Float following Consumption
Abstract
One fundamental axiom for project plan and schedule relates to the notion that time float will be reduced following its consumption. However, an anomalous scenario can emerge in which an activity’s time float increases following its consumption. By exploring the associations between time float and paths in activity networks, we (a) reveal the conditions under which the anomaly occurs and (b) summarize laws related to total float. An activity’s total float increases in parallel with its duration prolongation within a given boundary but remains constant or decreases in parallel with a prolongation outside the boundary. Furthermore, whereas a prolongation of an activity’s duration in excess of classic total float does not delay project completion time, a lag of its start time to a degree slightly greater than the total float does. This analysis reveals different types of total float that correspond to different ways of usage. From this, we offer definitions for translation total float and prolongation total float that deviate from traditional conventions regarding the uniqueness of total float.
1. Introduction
Current trends in production are characterized by an increasingly intense competition in sectors dependent on time. George [1] first regarded time as a source of competitive advantage, thereby prompting managers to emphasize the importance of time performance in project management [2–4]. Many researchers have explored timebased competition [5–7], which consists of several timerelated concepts. These concepts include processing time, setup time, zero time, and justintime delivery [8]. Careful planning is antecedent to the achievement of competitive advantages related to time. Related to this, multiple theories and industry practices have shown that time float is a key factor for developing such a plan [9–14]. An activity’s time float not only signifies the degree to which that activity is important to a project but also reflects the project’s structural properties and guides project plan and schedule. Given its import, time float has long been considered as an important parameter for project optimization.
Similar to its counterpart in the field of geometry (e.g., the parallel axiom in Euclidean geometry), one fundamental axiom of project plan and schedule stipulates that an activity’s time float will be reduced following its consumption. However, we reveal an anomaly that an activity’s time float increases rather than decreases while it is being consumed. This contradicts the fundamental axiom of time float. Furthermore, as a source of competitive advantage, an increase in time float following consumption may reflect the possibility that other special sources may increase following consumption. Given these findings, the anomaly may provide valuable insight into resource optimization. Therefore, in this paper, we empirically explore the time float anomaly with the goal of project optimization.
The anomaly described above appears in complex projects, such as projects with generalized precedence relations (GPRs). The GPRs are temporal constraints that mandate that the starting/finishing times of a pair of activities be separated by a minimum or maximum amount of time. This anomaly contradicts not only the time float axiom but also several current approaches to project optimization. For instance, in resource and duration optimization, managers often reduce some resources (e.g., staff, funds, and materials for noncritical activities) to reduce costs or apply resources from noncritical activities to critical activities to expedite project completion. Reductions in resources for noncritical activities are constrained by the activities’ total floats. Reducing these resources to a substantial degree can cause prolongation of an activity’s duration. Conventional thinking dictates that the prolongation of an activity’s duration in excess of its total float delays project completion time. However, the discovery of the “postconsumption total float increase” anomaly seems to free managers from the need to reduce staff, funds, or materials and extends space to allow for resource optimization. However, this anomaly raises several questions.(i)Not all activities cause total float to increase. What conditions are necessary for the anomaly to occur?(ii)Does an activity’s total float consistently increase in parallel with the prolongation of its duration? If not, when will total float not increase? How will total float change after the activity duration is prolonged?(iii)Although an activity’s float consumption may cause total float to increase, will its duration prolongation delay project completion time? If yes, by how much? The answers to these and other questions can significantly influence project plan and schedule.
In this paper, we explain the anomaly and primarily focus on laws related to total floats and the prolongation of activity duration to address the questions above. These conclusions theoretically contribute to discussions related to total float and provide guidance related to project optimization with GPRs.
2. Previous Work
Following the emergence of GPRs [15, 16], some authors have studied the characteristics of these precedence relations [17–26]. Others have investigated project scheduling with GPRs, such as resourceconstrained project scheduling with GPRs [23, 27–38], timecost tradeoff with GPRs [18, 22, 39, 40], and resource leveling with GPRs [41–45].
Scholars often extend theoretical premises within their respective fields by discovering theoretical contradictions to conventionally held ideas. For example, extensions within the field of earth science have allowed scientists to observe the curvature of light. Similarly, extensions of the study of activity networks (representing projects) allowed for the discovery of some abnormal characteristics [17–20, 25]. In particular, Elmaghraby and Kamburowski [18] uncovered anomalies related to critical activities (with classic time floats equal to 0) under GPRs.(i)The prolongation of a critical activity’s duration reduces (rather than increases) the time it takes to complete the project.(ii)Both the prolongation and shortening of a critical activity’s duration left the time to complete the project unchanged.(iii)Reducing the duration of a critical activity renders the activity network infeasible.
Critical activities are those that are crucial to moving a project towards completion, and difficulty in project plan in general has a significant impact on critical tasks and measures [46]. The discovery of anomalies associated with critical activities shook the conceptual foundations of the classic approaches to project scheduling and provided the basis for many of the approaches that are currently used. One of the anomalies’ greatest impacts relates to the timecost tradeoff with GPRs, because the tradeoff process involves the adjustment of critical activities’ durations. Elmaghraby and Kamburowski [18] investigated the timecost tradeoffs with GPRs by prolonging instead of shortening activity durations. Some others utilized mathematical programming and approximate methods [22, 39, 40]. The adjustment of activity duration is also a method for evaluating resourceconstrained project scheduling and resource leveling in such a way to determine how the anomalies influence the problems with GPRs. Some authors have developed other approaches to solve these problems in their investigations of the nature of the anomalies and have included the branchandbound algorithm [28–33], the approximate algorithm [42, 43], the subgradient algorithm [32, 33], the minflow algorithm [35], and the pathrelinking metaheuristic algorithm [45]. These approaches effectively dealt with critical activity anomalies and have served as viable contributions to the field of plan management.
Although a substantial amount of empirical attention has been paid to critical activities, extant research on noncritical activities (with time floats greater than 0) under GPRs has been insufficient thus far. To redress this deficiency in the literature, we extend previous research and focus on noncritical activities.
3. Generalized Precedence Relations (GPRs)
3.1. Types of GPRs
GPRs can be classified as FinishtoStart, FinishtoFinish, StarttoStart, and StarttoFinish relations. These four constraint types double when minimum and maximum time lags are concerned, as follows.
FinishtoStart minimum time lag (): the start time of an activity occurs no earlier than units after the finish time of an activity .
FinishtoFinish minimum time lag (): the finish time of an activity occurs no earlier than units after the finish time of an activity .
StarttoStart minimum time lag (): the start time of an activity occurs no earlier than units after the start time of an activity .
StarttoFinish minimum time lag (): the finish time of an activity occurs no earlier than units after the start time of an activity .
FinishtoStart maximum time lag (): the start time of an activity occurs no later than units after the finish time of an activity .
FinishtoFinish maximum time lag (): the finish time of an activity occurs no later than units after the finish time of an activity .
StarttoStart maximum time lag (): the start time of an activity occurs no later than units after the start time of an activity .
StarttoFinish maximum time lag (): the finish time of an activity occurs no later than units after the start time of an activity .
3.2. Representation of GPRs
The activity network under GPRs proposed by Elmaghraby and Kamburowski [18] is the current standard activityonarc representation of GPRs. In the network, an activity is represented as two oppositely directed arcs with opposite length values (whose absolute values are equal to the activity duration). A time lag is represented as an arc. Table 1 lists activities of a project and precedence relations among them, and they can be represented as a standard activity network under GPRs, as shown in Figure 1.

The following equations depict classic time parameters of an activity , which contain the earliest start time , latest finish time , total float , free float , and safety float : where indicates the longest path from the node to node , indicates the critical path, and indicates the set of arcs representing time lags.
4. Anomaly: The Increase in Time Float following Consumption
Conventional thinking dictates that the total float limits the degree to which an activity’s duration can be prolonged and is determined by the structure of the activity network structure (e.g., the preceding and succeeding activities of the activity and project completion). As axioms, it is widely accepted that (a) the prolongation of an activity’s duration consumes total float and (b) the degree to which the prolongation exceeds total float delays the project completion time.
However, we have discovered anomalies that contradict these axioms. Specifically, we have found that total float can increase following its consumption and that it is possible for the project completion to avoid delay, even if the prolongation of one of its constituent activities exceeds the total float.
For example, in Figure 1, according to (3), the total float of activity can be computed as follows: We prolong its duration by 9 (see Figure 2) and compute its total float as follows: Although the durations of other activities and project completion time are unchanged, the prolongation of the duration of activity results in the increase instead of decrease in its total float. Furthermore, the prolongation 9 of activity is greater than its initial total float 8, but it does not cause a delay in the project completion time. The example tests that the total float of an activity may be invalid to restrain the activity’s duration.
However, when we delay activity ’s start time by 9 in Figure 1 (equal to adding an arc with , as in Figure 3), the project completion is delayed by 1. And when we delay activity ’s start time by 17 in Figure 2 (its total float is 16 in the figure), as in Figure 4, the project completion is delayed by 1 too. The example illustrates that the total float can restrain the start time of an activity with a given duration, and it may increase following the prolongation of the activity’s duration.
The above research signifies that the total float may have different values in accordance with its different usages. We challenge the notion of the classical total float and define two new types of total floats—“translation total float” and “prolongation total float.”
(1) Translation Total Float. Under constraints that retain the project completion time, the translation total float is defined as the maximum amount of time that the start of activity with a given duration can be delayed from its earliest start time. We mark it as , which is identical to the classical total float in nature; that is,
(2) Prolongation Total Float. Under constraints that retain the project completion time, the prolongation total float is defined as the maximum amount of time that the duration of activity can be prolonged from its initial one. We mark it as , which may be different from .
The two new types of total floats provide reasonable explanations for the anomaly of the time float increases following its consumption. The translation total float of an activity may increase when the activity prolongs its duration (consumes its prolongation total float). There is no anomaly in the case of considering each type of total float, respectively; that is, the translation (prolongation) total float decreases following its consumption.
5. Preliminary Theory
5.1. Accessory Concepts
In order to facilitate descriptions in the following sections, here we introduce some parameters: for an arc in the activity network under GPRs, and for a node ,
5.2. Relations between Parameter and Path
In exploring the relationships between the above parameters and paths, we have deduced the following theorems and corollaries. The relationships are indispensable to uncover laws of time parameters of an activity in the next section.
Theorem 1. For the longest path and a path from the beginning node to a node , their lengths satisfy
Proof. See Appendix A.
Theorem 2. For the longest path and a path from a node to the terminal node , their lengths satisfy
Proof. Similar to Theorem 1.
6. Laws of Time Parameters of an Activity
Assume that an activity is represented as two arcs: with length and with length . Activity ’s start and finish nodes are and , respectively. In this paper, we explore laws of time parameters associated with activity .
The activity network under GPRs permits no cycles with positive length. If is on a cycle () with length , a prolongation of activity such that will result in an infeasible network with . For the purposes of our investigation, we assume to ensure that .
6.1. The Earliest Start Time
In conventional approaches to exploring float, the earliest start time of an activity is determined by its preceding activities. Therefore, an activity’s earliest start time will remain unchanged as long as other activities remain unchanged as well.
However, we find that an activity’s start time may be advanced even if other activities remain unchanged (see Figure 2). In this subsection, we study this anomaly and summarize the following law of the earliest start time of an activity associated with this anomaly. For the activity , assume that and denote its initial and following earliest start times, and and denote its initial and following durations, respectively.
Law 1. If , the laws of the earliest start time are as follows when and .
(1) If , then
and then
(2) If , then
This reflects the notion that the actual earliest start time is earlier than the classical earliest start time .
Proof. See Appendix B.
6.2. The Latest Finish Time
Conventional thinking dictates that the latest finish time of an activity is determined by the activities that succeed it and the overall completion of the project. As such, a latest finish time will not be delayed as long as the durations of other activities and project completion time remain unchanged.
However, we find that the latest finish time may be delayed even under the above conditions (see Figure 2). By exploring this anomaly, we summarize the following law of the latest finish time of an activity associated with this anomaly. For the activity , assume that and denote its initial and following latest finish times, respectively.
Law 2. If , under the condition of retaining project completion time, the laws of the latest finish time are as follows when and .
(1) If , then
and then
(2) If , then
This demonstrates that the actual latest finish time is later than the classical latest finish time .
Proof. See Appendix C.
6.3. Total Float
According to Section 4, the translation (prolongation) total float decreases following its consumption, but the translation total float of an activity may increase when the activity consumes its prolongation total float. We summarize the following laws of the total float of an activity (as in Figures 5–7). For the activity , assume that and denote its initial and following translation total floats, respectively, and denote its initial classical total float.
Law 3. If and , then for and we have the following.
(1) If , then
and then
(2) If , then
and then
(3) If , then
and then
(4) If , then the project completion time will be delayed. This shows that the prolongation total float needed to maintain the project completion is greater than the classical one .
Proof. See Appendix D.
Law 4. If or (but not both) is equal to 0, then for and we have the following.
(1) If , then
and then
(2) If , then
and then
(3) If , the project completion will be delayed. This reflects that the actual total float needed to maintain the project completion exceeds the classic one .
Proof . See Appendix E.
Law 5. If and , then and then when and .
Proof. See Appendix F.
According to Laws 3–5, we achieve the following sufficient and necessary conditions of the anomaly in Section 4 and deduce the formula of prolongation total float.
Corollary 3. For an activity , and are sufficient and necessary conditions for total float to increase following consumption. Moreover, the duration interval for this anomaly is .
Corollary 4. The prolongation total float of activity is and denotes the lengths of cycles passing the but not passing the .
7. A Numerical Example
To illustrate the arguments outlined above, we analyze the laws of total float of activity in Figure 1.
According to Figure 1 and (9)–(13), is represented as arcs and , and
Because , , and no cycles pass the arc , according to Law 3 in Section 6.3.
(1) If , namely, and , then and then
(2) If , namely, and , then and then
(3) If , namely, and , then and then
(4) If , namely, and , the project completion will be delayed.
We summarize these results as a variety of laws related to translation total float of activity in the process of consuming its prolongation total float. In doing so, we obtain Figure 8. For activity , we have the following.(i)In the duration interval , its translation total float increases (from 8 to 16) in conjunction with the duration prolongation.(ii)In the duration interval , its translation total float remains unchanged (the value is 16) despite the duration prolongation.(iii)In the duration interval , its translation total float decreases (from 16 to 0) in conjunction with the duration prolongation.(iv)Its duration 179 causes the translation total float to be equal to 0, causing a delay of its start time to induce a delay in the project completion.
According to (34), because is nonexistent, we let and compute Therefore, in the duration interval of , its prolongation total float consistently decreases (from 109 to 0) in conjunction with the duration prolongation. As a result, delaying project completion requires a longer time than its duration of 179. In addition, because , the project completion time will be delayed if (a) activity ’s start time is delayed by more than 8 or (b) its duration is prolonged more than 109.
Furthermore, we test that the translation total floats of activities and also increase following the prolongation of their durations. But the ones of the other activities are bound to decrease following the prolongation of their durations.
8. Conclusions
The phenomenon whereby time float increases following its consumption is a perfect condition for planning and scheduling that may simplify various problems and optimize operations. However, conventional theorizing about float time suggests that this phenomenon is imaginary. The view that time float is reduced when it is consumed remains a dominant perspective for project plan and schedule.
Challenging established axioms often results in crucial scientific advances. For example, nonEuclidean geometry was created on the basis of challenges to the parallel axiom in Euclidean geometry. Similarly, we questioned the generally accepted time float axiom and discovered the existence of an anomaly such that time float increases following consumption. Time is regarded as a source of competitive advantage; therefore, the anomaly of time float provides the prospect that other sources may also increase following consumption. We gain an enlightenment from the anomaly that the total float may be manifold corresponding to different usages and uncover two new types: translation total float and prolongation total float. The two concepts illustrate the multivalued nature of total float, which challenges conventional theorizing about the uniqueness of total float. We further summarize the laws of total floats, which perfectly explain the anomaly.
Despite its contributions, this paper does not consider other activity time floats, such as free float and safety float. Our future research endeavors include the study of laws related to these time floats following their respective consumption and the application of those laws to optimize project plan and schedule.
Appendices
A. Proof of Theorem 1
Assume , according to (9), And according to (1), Therefore, Equation (14) is correct.
B. Proof of Law 1
Figure 9 shows each type of path passing activity in an activity network under GPRs. According to (11) and (14), assume ; then , . And according to Figure 9, Substituting (1) in (B.1), Owing to , according to (14), so that According to (B.1), and substitute it in (14) as follows Therefore, In Figure 9, the arcs and are not on and . If for , then and causes ; therefore, that is, According to (1) and (B.2)–(B.9), Therefore, if , then If , then Equations (16) and (18) are correct.
C. Proof of Law 2
According to (13) and (14), assume (see Figure 9); then , . Based on Figure 9, Substituting it in (2), Owing to , according to (15), so that According to (C.1), combined with (15), In Figure 9, the arcs and are not on and . If for , then , , and Therefore, that is, According to the known condition, . Therefore, combining it with (2) and (C.2)–(C.8), Therefore, if , then Further, if , then Equations (19) and (21) are correct.
D. Proof of Law 3
We assume that . Therefore, and . Assume and .
(1) If , namely, , according to (1), (2), (16), and (19), , . Substituting them in (3), Equation (22) is correct.
(2) If , namely, , according to (1), (2), (18), and (21), , . Substituting them in (3), Equation (24) is correct.
(3) If , namely, , according to (1), (2), (18), and (21), , . Substituting them in (3), Under the precondition of retaining project completion, , hence Equation (26) is correct.
(4) If , according to (3) and (11), and activity becomes a critical one. Now a new critical path passes the . If , the prolongation of will cause a prolongation in . Therefore, the project completion will be delayed, and the actual total float for retaining the project completion time is .
E. Proof of Law 4
In Figure 5, if either or (but not both) is equal to 0, then Therefore, Figure 5 becomes Figure 6, and Figure 6 illustrates Law 4.
F. Proof of Law 5
In Figure 6, if and , then Therefore, Figure 6 becomes Figure 7, and Figure 7 illustrates Law 5.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The authors would like to acknowledge the Natural Science Foundation of China and the Fundamental Research Funds for the Central Universities for financially supporting this work under Contract nos. 71171079, 71271081, and 13ZD08. The authors are also grateful to the anonymous referee for a careful review of the details of this paper and the helpful suggestions that led to its improvement.
References
 S. J. George, “Time—the next source of competitive advantage,” Harvard Business Review, vol. 7, pp. 42–52, 1988. View at: Google Scholar
 C. Gomes da Silva, J. Figueira, J. Lisboa, and S. Barman, “An interactive decision support system for an aggregate production planning model based on multiple criteria mixed integer linear programming,” Omega, vol. 34, no. 2, pp. 167–177, 2006. View at: Publisher Site  Google Scholar
 I. V. Gribkovskaia, S. Kovalev, and F. Werner, “Batching for work and rework processes on dedicated facilities to minimize the makespan,” Omega, vol. 38, no. 6, pp. 522–527, 2010. View at: Publisher Site  Google Scholar
 M. Vanhoucke, “Using activity sensitivity and network topology information to monitor project time performance,” Omega, vol. 38, no. 5, pp. 359–370, 2010. View at: Publisher Site  Google Scholar
 H. Kaynak and J. L. Hartley, “Using replication research for justintime purchasing construct development,” Journal of Operations Management, vol. 24, no. 6, pp. 868–892, 2006. View at: Publisher Site  Google Scholar
 A. W. MacKelprang and A. Nair, “Relationship between justintime manufacturing practices and performance: a metaanalytic investigation,” Journal of Operations Management, vol. 28, no. 4, pp. 283–302, 2010. View at: Publisher Site  Google Scholar
 J. Blackburn, “Valuing time in supply chains: establishing limits of timebased competition,” Journal of Operations Management, vol. 30, no. 5, pp. 396–405, 2012. View at: Publisher Site  Google Scholar
 R. Q. Chen and S. H. Ma, Production and Operations Management, China Machine Press, Beijing, China, 2006.
 J. E. Kelley Jr. and M. R. Walker, “Critical path planning and scheduling,” in Proceeding of the Eastern Joint IREAIEEACM Computer Conference, vol. 16, pp. 160–173, 1959. View at: Google Scholar
 T. Warren, “Four oat measures for critical path scheduling,” Industrial Engineering, vol. 1, no. 10, pp. 19–23, 1969. View at: Google Scholar
 A. Battersby, Network Analysis for Planning and Scheduling, Wiley, New York, NY, USA, 3rd edition, 1970.
 S. E. Elmaghraby, Activity Network: Project Planning and Control by Network Models, John Wiley & Sons, New York, NY, USA, 1977.
 S. E. Elmaghraby and J. Kamburowski, “On project rep resentation and activity oats,” Arabian Journal for Science Engineering, vol. 15, no. 4, pp. 627–637, 1990. View at: Google Scholar
 O. Zwikael and A. Sadeh, “Planning effort as an effective risk management tool,” Journal of Operations Management, vol. 25, no. 4, pp. 755–767, 2007. View at: Publisher Site  Google Scholar
 B. Roy, “Graphes et ordonnancements,” Revue Francaise Recherche Operations, vol. 25, pp. 323–326, 1962. View at: Google Scholar
 S. E. Elmaghraby, “An algebra for the analysis of generalized activity networks,” Management Science, vol. 10, pp. 494–514, 1964. View at: Google Scholar
 J. D. Wiest, “Precedence diagramming method: some unusual characteristics and their implications for project managers,” Journal of Operations Management, vol. 1, no. 3, pp. 121–130, 1981. View at: Publisher Site  Google Scholar
 S. E. Elmaghraby and J. Kamburowski, “The analysis of activity networks under generalized precedence relations (GPRs),” Management Science, vol. 38, no. 9, pp. 1245–1263, 1992. View at: Google Scholar
 Y. L. Chen, D. Rinks, and K. Tang, “Critical path in an activity network with time constraints,” European Journal of Operational Research, vol. 100, no. 1, pp. 122–133, 1997. View at: Publisher Site  Google Scholar
 V. Valls and P. Lino, “Criticality analysis in activityonnode networks with minimal time lags,” Annals of Operations Research, vol. 102, pp. 17–37, 2001. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 D. J. Harmelink, “Linear scheduling model: float characteristics,” Journal of Construction Engineering and Management, vol. 127, no. 4, pp. 255–260, 2001. View at: Publisher Site  Google Scholar
 A. P. Chassiakos and S. P. Sakellaropoulos, “Timecost optimization of construction projects with generalized activity constraints,” Journal of Construction Engineering and Management, vol. 131, no. 10, pp. 1115–1124, 2005. View at: Publisher Site  Google Scholar
 M. Ishaque, A. K. Zaidi, and A. H. Levis, “Project management using point graphs,” Systems Engineering, vol. 12, no. 1, pp. 36–54, 2009. View at: Publisher Site  Google Scholar
 G. Lucko and A. A. P. Orozco, “Float types in linear schedule analysis with singularity functions,” Journal of Construction Engineering and Management, vol. 135, no. 5, pp. 368–377, 2009. View at: Publisher Site  Google Scholar
 S. H. Yakhchali and S. H. Ghodsypour, “Computing latest starting times of activities in intervalvalued networks with minimal time lags,” European Journal of Operational Research, vol. 200, no. 3, pp. 874–880, 2010. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 M. Caramia and F. Guerriero, “A note on the modelling of project networks with time constraints,” European Journal of Operational Research, vol. 211, no. 3, pp. 666–670, 2011. View at: Publisher Site  Google Scholar
 P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resourceconstrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at: Publisher Site  Google Scholar
 U. Dorndorf, E. Pesch, and T. PhanHuy, “Timeoriented branchandbound algorithm for resourceconstrained project scheduling with generalized precedence constraints,” Management Science, vol. 46, no. 10, pp. 1365–1384, 2000. View at: Google Scholar
 B. Afshar Nadjafi and S. Shadrokh, “A branch and b ound algorithm for the weighted earlinesstardiness project scheduling problem with gen eralized precedence relations,” Scientia Iranica, vol. 16, no. 1 E, pp. 55–64, 2009. View at: Google Scholar
 L. Bianco and M. Caramia, “A new formulation of the resourceunconstrained project scheduling problem with generalized precedence relations to minimize the completion time,” Networks, vol. 56, no. 4, pp. 263–271, 2010. View at: Publisher Site  Google Scholar  MathSciNet
 L. Bianco and M. Caramia, “A new lower bound for the resourceconstrained project scheduling problem with generalized precedence relations,” Computers and Operations Research, vol. 38, no. 1, pp. 14–20, 2011. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 L. Bianco and M. Caramia, “An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations,” European Journal of Operational Research, vol. 219, no. 1, pp. 73–85, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 L. Bianco and M. Caramia, “Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm,” 4OR, vol. 10, no. 4, pp. 361–377, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 A. Alfieri, T. Tolio, and M. Urgo, “A project scheduling approach to production planning with feeding precedence relations,” International Journal of Production Research, vol. 49, no. 4, pp. 995–1020, 2011. View at: Publisher Site  Google Scholar
 M. Lombardi and M. Milano, “A minflow algorithm for minimal critical set detection in resource constrained project scheduling,” Artificial Intelligence, vol. 182183, pp. 58–67, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 A. D. Chaney, R. F. Deckro, and J. T. Moore, “Scheduling reconstruction operations with modes of execution,” Journal of the Operational Research Society, vol. 64, no. 6, pp. 898–911, 2013. View at: Publisher Site  Google Scholar
 A. Schutt, T. Feydy, and P. J. a. Stuckey, “Solving RCPSP/max by lazy clause generation,” Journal of Scheduling, vol. 16, no. 3, pp. 273–289, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 M. Tavana, A. R. Abtahi, and K. KhaliliDamghani, “A new multiobjective multimode model for solving preemptive timecostquality tradeoff project scheduling problems,” Expert Systems with Applications, vol. 41, no. 4, pp. 1830–1846, 2014. View at: Publisher Site  Google Scholar
 K. Neumann and J. Zhan, “Heuristics for the minimum projectduration problem with minimal and maximal time lags under fixed resource constraints,” Journal of Intelligent Manufacturing, vol. 6, no. 2, pp. 145–154, 1995. View at: Publisher Site  Google Scholar
 S. Sakellaropoulos and A. P. Chassiakos, “Project timecost analysis under generalised precedence relations,” Advances in Engineering Software, vol. 35, no. 1011, pp. 715–724, 2004. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 E. L. Demeulemeester and W. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Boston, Mass, USA, 2002.
 M. E. Georgy, “Evolutionary resource scheduler for linear projects,” Automation in Construction, vol. 17, no. 5, pp. 573–583, 2008. View at: Publisher Site  Google Scholar
 G. Lucko, “Integrating efficient resource optimization and linear schedule analysis with singularity functions,” Journal of Construction Engineering and Management, vol. 137, no. 1, pp. 45–55, 2011. View at: Publisher Site  Google Scholar
 J. Rieck, J. Zimmermann, and T. Gather, “Mixedinteger linear programming for resource leveling problems,” European Journal of Operational Research, vol. 221, no. 1, pp. 27–37, 2012. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. Ranjbar, “A pathrelinking metaheuristic for the resource levelling problem,” Journal of the Operational Research Society, vol. 64, no. 7, pp. 1071–1078, 2013. View at: Publisher Site  Google Scholar
 E. Bendoly, J. E. PerrySmith, and D. G. Bachrach, “The perception of difficulty in projectwork planning and its impact on resource sharing,” Journal of Operations Management, vol. 28, no. 5, pp. 385–397, 2010. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Jianxun Qi and Zhixiong Su. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.