Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 628259, 9 pages
http://dx.doi.org/10.1155/2015/628259
Research Article

A Branch and Bound Algorithm for Project Scheduling Problem with Spatial Resource Constraints

1School of Economics and Management, Harbin Institute of Technology, Weihai 264209, China
2Department of Mathematics, Harbin Institute of Technology, Weihai 264209, China
3School of Software, Sun Yat-sen University, Guangzhou 510275, China

Received 1 September 2014; Accepted 28 September 2014

Academic Editor: Yunqiang Yin

Copyright © 2015 Shicheng Hu et al. 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. Hartmann and D. Briskorn, “A survey of variants and extensions of the resource-constrained project scheduling problem,” European Journal of Operational Research, vol. 207, no. 1, pp. 1–14, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. P. Brucker and S. Knust, “Linear programming and constraint propagation-based lower bound for the RCPSP,” European Journal of Operational Research, vol. 127, no. 2, pp. 355–362, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. R. Kolisch and R. Padman, “An integrated survey of deterministic project scheduling,” Omega, vol. 29, no. 3, pp. 249–272, 2001. View at Publisher · View at Google Scholar · View at Scopus
  4. Z. He, N. Wang, T. Jia, and Y. Xu, “Simulated annealing and tabu search for multi-mode project payment scheduling,” European Journal of Operational Research, vol. 198, no. 3, pp. 688–696, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. M. Mika, G. Waligóra, and J. Weglarz, “Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times,” European Journal of Operational Research, vol. 187, no. 3, pp. 1238–1250, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. S. Hartmann, “A self-adapting genetic algorithm for project scheduling under resource constraints,” Naval Research Logistics, vol. 49, no. 5, pp. 433–448, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. A. Agarwal, S. Colak, and S. Erenguc, “A Neurogenetic approach for the resource-constrained project scheduling problem,” Computers and Operations Research, vol. 38, no. 1, pp. 44–50, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. R. Agarwal, M. K. Tiwari, and S. K. Mukherjee, “Artificial immune system based approach for solving resource constraint project scheduling problem,” The International Journal of Advanced Manufacturing Technology, vol. 34, no. 5-6, pp. 584–593, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. W. Chen, J. Zhang, H. S. Chung, R. Z. Huang, and O. Liu, “Optimizing discounted cash flows in project scheduling-an ant colony optimization approach,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 40, no. 1, pp. 64–77, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. H. Zhang, X. Li, H. Li, and F. Huang, “Particle swarm optimization-based schemes for resource-constrained project scheduling,” Automation in Construction, vol. 14, no. 3, pp. 393–404, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. M. Ranjbar, B. De Reyck, and F. Kianfar, “A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling,” European Journal of Operational Research, vol. 193, no. 1, pp. 35–48, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. R. Klein and A. Scholl, “PROGRESS: optimally solving the generalized resource-constrained project scheduling problem,” Mathematical Methods of Operations Research, vol. 52, no. 3, pp. 467–488, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. J. Coelho and M. Vanhoucke, “Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers,” European Journal of Operational Research, vol. 213, no. 1, pp. 73–82, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Lova, P. Tormos, M. Cervantes, and F. Barber, “An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes,” International Journal of Production Economics, vol. 117, no. 2, pp. 302–316, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. S. C. Hu and X. F. Xu, “A production scheduling algorithm for cost optimization,” Computer Integrated Manufacturing Systems, vol. 9, no. 9, pp. 735–739, 2003. View at Google Scholar
  16. M. J. Sobel, J. G. Szmerekovsky, and V. Tilson, “Scheduling projects with stochastic activity duration to maximize expected net present value,” European Journal of Operational Research, vol. 198, no. 3, pp. 697–705, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. K. Neumann and J. Zimmermann, “Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints,” European Journal of Operational Research, vol. 127, no. 2, pp. 425–443, 2000. View at Publisher · View at Google Scholar · View at Scopus
  18. G. Waligóra, “Discrete-continuous project scheduling with discounted cash flows—a tabu search approach,” Computers & Operations Research, vol. 35, no. 7, pp. 2141–2153, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Yin, T. C. E. Cheng, and C.-C. Wu, “Scheduling with time-dependent processing times,” Mathematical Problems in Engineering, vol. 2014, Article ID 201421, 2 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. Y. Q. Yin, W. H. Wu, T. C. E. Cheng, and C. C. Wu, “Single-machine scheduling with time-dependent and position-dependent deteriorating jobs,” International Journal of Computer Integrated Manufacturing, 2014. View at Publisher · View at Google Scholar
  21. Y. Yin, S.-R. Cheng, and C.-C. Wu, “Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties,” Information Sciences, vol. 189, pp. 282–292, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. Y. Yin, D. Xu, K. Sun, and H. Li, “Some scheduling problems with general position-dependent and time-dependent learning effects,” Information Sciences, vol. 179, no. 14, pp. 2416–2425, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. Y. Q. Yin, M. Liu, J. H. Hao, and M. C. Zhou, “Single-machine scheduling with job-position-dependent learning and time-dependent deterioration,” IEEE Transactions on Systems, Man, and Cybernetics: Systems and Humans, vol. 42, no. 1, pp. 192–200, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. K. J. Lee, J. K. Lee, and S. Y. Choi, “A spatial scheduling system and its application to shipbuilding: DAS-CURVE,” Expert Systems with Applications, vol. 10, no. 3-4, pp. 311–324, 1996. View at Publisher · View at Google Scholar · View at Scopus
  25. C. Park, K.-H. Chung, J.-C. Park, K.-K. Cho, T.-H. Baek, and E.-I. Son, “A spatial scheduling application at the block paint shop in shipbuilding: the HYPOS project,” Production Planning and Control, vol. 13, no. 4, pp. 342–354, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. R. Varghese and D. Y. Yoon, “Dynamic spatial block arrangement scheduling in shipbuilding industry using genetic algorithm,” in Proceedings of the IEEE 3rd International Conference on Industrial Informatics (INDIN ’05), pp. 444–449, IEEE, August 2005. View at Publisher · View at Google Scholar
  27. S. Koh, R. Logendran, D. Choi, and S. Woo, “Spatial scheduling for shape-changing mega-blocks in a shipbuilding company,” International Journal of Production Research, vol. 49, no. 23, pp. 7135–7149, 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. C. Steiger, H. Walder, and M. Platzner, “Operating systems for reconfigurable embedded platforms: online scheduling of real-time tasks,” IEEE Transactions on Computers, vol. 53, no. 11, pp. 1393–1407, 2004. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Dell'Amico, J. C. D. Díaz, and M. Iori, “The bin packing problem with precedence constraints,” Operations Research, vol. 60, no. 6, pp. 1491–1504, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. R. Kolisch and A. Sprecher, “PSPLIB—a project scheduling problem library,” European Journal of Operational Research, vol. 96, no. 1, pp. 205–216, 1997. View at Publisher · View at Google Scholar · View at Scopus