Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 415870, 12 pages
http://dx.doi.org/10.1155/2014/415870
Research Article

Analysis of an Anomaly: The Increase in Time Float following Consumption

1School of Economics and Management, North China Electric Power University, Beijing 102206, China
2Business Administration College, Nanchang Institute of Technology, Nanchang 330099, China

Received 18 June 2014; Accepted 19 July 2014; Published 27 August 2014

Academic Editor: Wen-Chuan Lee

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.

Linked References

  1. S. J. George, “Time—the next source of competitive advantage,” Harvard Business Review, vol. 7, pp. 42–52, 1988. View at Google Scholar
  2. 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 · View at Google Scholar · View at Scopus
  3. 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 · View at Google Scholar · View at Scopus
  4. 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 · View at Google Scholar · View at Scopus
  5. H. Kaynak and J. L. Hartley, “Using replication research for just-in-time purchasing construct development,” Journal of Operations Management, vol. 24, no. 6, pp. 868–892, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. A. W. MacKelprang and A. Nair, “Relationship between just-in-time manufacturing practices and performance: a meta-analytic investigation,” Journal of Operations Management, vol. 28, no. 4, pp. 283–302, 2010. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Blackburn, “Valuing time in supply chains: establishing limits of time-based competition,” Journal of Operations Management, vol. 30, no. 5, pp. 396–405, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. R. Q. Chen and S. H. Ma, Production and Operations Management, China Machine Press, Beijing, China, 2006.
  9. J. E. Kelley Jr. and M. R. Walker, “Critical path planning and scheduling,” in Proceeding of the Eastern Joint IRE-AIEE-ACM Computer Conference, vol. 16, pp. 160–173, 1959.
  10. T. Warren, “Four oat measures for critical path scheduling,” Industrial Engineering, vol. 1, no. 10, pp. 19–23, 1969. View at Google Scholar
  11. A. Battersby, Network Analysis for Planning and Scheduling, Wiley, New York, NY, USA, 3rd edition, 1970.
  12. S. E. Elmaghraby, Activity Network: Project Planning and Control by Network Models, John Wiley & Sons, New York, NY, USA, 1977.
  13. 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
  14. 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 · View at Google Scholar · View at Scopus
  15. B. Roy, “Graphes et ordonnancements,” Revue Francaise Recherche Operations, vol. 25, pp. 323–326, 1962. View at Google Scholar
  16. S. E. Elmaghraby, “An algebra for the analysis of generalized activity networks,” Management Science, vol. 10, pp. 494–514, 1964. View at Google Scholar
  17. 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 · View at Google Scholar · View at Scopus
  18. 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
  19. 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 · View at Google Scholar · View at Scopus
  20. V. Valls and P. Lino, “Criticality analysis in activity-on-node networks with minimal time lags,” Annals of Operations Research, vol. 102, pp. 17–37, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. 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 · View at Google Scholar · View at Scopus
  22. A. P. Chassiakos and S. P. Sakellaropoulos, “Time-cost 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 · View at Google Scholar · View at Scopus
  23. 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 · View at Google Scholar · View at Scopus
  24. 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 · View at Google Scholar · View at Scopus
  25. S. H. Yakhchali and S. H. Ghodsypour, “Computing latest starting times of activities in interval-valued networks with minimal time lags,” European Journal of Operational Research, vol. 200, no. 3, pp. 874–880, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. 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 · View at Google Scholar · View at Scopus
  27. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at Publisher · View at Google Scholar · View at Scopus
  28. U. Dorndorf, E. Pesch, and T. Phan-Huy, “Time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints,” Management Science, vol. 46, no. 10, pp. 1365–1384, 2000. View at Google Scholar · View at Scopus
  29. B. Afshar Nadjafi and S. Shadrokh, “A branch and b ound algorithm for the weighted earliness-tardiness project scheduling problem with gen eralized precedence relations,” Scientia Iranica, vol. 16, no. 1 E, pp. 55–64, 2009. View at Google Scholar · View at Scopus
  30. L. Bianco and M. Caramia, “A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time,” Networks, vol. 56, no. 4, pp. 263–271, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. L. Bianco and M. Caramia, “A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations,” Computers and Operations Research, vol. 38, no. 1, pp. 14–20, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. 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 · View at Google Scholar · View at MathSciNet · View at Scopus
  33. 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 · View at Google Scholar · View at MathSciNet · View at Scopus
  34. 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 · View at Google Scholar · View at Scopus
  35. M. Lombardi and M. Milano, “A min-flow algorithm for minimal critical set detection in resource constrained project scheduling,” Artificial Intelligence, vol. 182-183, pp. 58–67, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. 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 · View at Google Scholar · View at Scopus
  37. 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 · View at Google Scholar · View at MathSciNet · View at Scopus
  38. M. Tavana, A. R. Abtahi, and K. Khalili-Damghani, “A new multi-objective multi-mode model for solving preemptive time-cost-quality trade-off project scheduling problems,” Expert Systems with Applications, vol. 41, no. 4, pp. 1830–1846, 2014. View at Publisher · View at Google Scholar
  39. K. Neumann and J. Zhan, “Heuristics for the minimum project-duration 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 · View at Google Scholar · View at Scopus
  40. S. Sakellaropoulos and A. P. Chassiakos, “Project time-cost analysis under generalised precedence relations,” Advances in Engineering Software, vol. 35, no. 10-11, pp. 715–724, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  41. E. L. Demeulemeester and W. Herroelen, Project Scheduling: A Research Handbook, Kluwer Academic Publishers, Boston, Mass, USA, 2002.
  42. M. E. Georgy, “Evolutionary resource scheduler for linear projects,” Automation in Construction, vol. 17, no. 5, pp. 573–583, 2008. View at Publisher · View at Google Scholar · View at Scopus
  43. 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 · View at Google Scholar · View at Scopus
  44. J. Rieck, J. Zimmermann, and T. Gather, “Mixed-integer linear programming for resource leveling problems,” European Journal of Operational Research, vol. 221, no. 1, pp. 27–37, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  45. M. Ranjbar, “A path-relinking metaheuristic for the resource levelling problem,” Journal of the Operational Research Society, vol. 64, no. 7, pp. 1071–1078, 2013. View at Publisher · View at Google Scholar · View at Scopus
  46. E. Bendoly, J. E. Perry-Smith, and D. G. Bachrach, “The perception of difficulty in project-work planning and its impact on resource sharing,” Journal of Operations Management, vol. 28, no. 5, pp. 385–397, 2010. View at Publisher · View at Google Scholar · View at Scopus