IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v111y1998i1p152-174.html
   My bibliography  Save this item

A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Ulrich Dorndorf & Erwin Pesch & Toàn Phan-Huy, 2000. "A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints," Management Science, INFORMS, vol. 46(10), pages 1365-1384, October.
  2. De Reyck, Bert & Herroelen, Willy, 1999. "The multi-mode resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 119(2), pages 538-556, December.
  3. Kai Watermeyer & Jürgen Zimmermann, 2020. "A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 427-460, June.
  4. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
  5. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
  6. Mario Vanhoucke, 2002. "Optimal due date assignment in project scheduling," Vlerick Leuven Gent Management School Working Paper Series 2002-19, Vlerick Leuven Gent Management School.
  7. Huan Neng Chiu & Deng Maw Tsai, 2002. "An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows," Construction Management and Economics, Taylor & Francis Journals, vol. 20(1), pages 55-66.
  8. Vanhoucke, M., 2006. "A scatter search procedure for maximizing the net present value of a project under renewable resource constraints," Vlerick Leuven Gent Management School Working Paper Series 2006-40, Vlerick Leuven Gent Management School.
  9. Brucker, Peter & Knust, Sigrid, 2003. "Lower bounds for resource-constrained project scheduling problems," European Journal of Operational Research, Elsevier, vol. 149(2), pages 302-313, September.
  10. Neumann, K. & Schwindt, C. & Zimmermann, J., 2003. "Order-based neighborhoods for project scheduling with nonregular objective functions," European Journal of Operational Research, Elsevier, vol. 149(2), pages 325-343, September.
  11. Bianco, Lucio & Caramia, Massimiliano, 2012. "An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 219(1), pages 73-85.
  12. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
  13. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
  14. Lin, Jun & Qian, Yanjun & Cui, Wentian & Goh, Thong Ngee, 2015. "An effective approach for scheduling coupled activities in development projects," European Journal of Operational Research, Elsevier, vol. 243(1), pages 97-108.
  15. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
  16. Moumene, Khaled & Ferland, Jacques A., 2009. "Activity list representation for a generalization of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 46-54, November.
  17. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
  18. Felix Hübner & Patrick Gerhards & Christian Stürck & Rebekka Volk, 2021. "Solving the nuclear dismantling project scheduling problem by combining mixed-integer and constraint programming techniques and metaheuristics," Journal of Scheduling, Springer, vol. 24(3), pages 269-290, June.
  19. Neumann, Klaus & Schwindt, Christoph & Trautmann, Norbert, 2005. "Scheduling of continuous and discontinuous material flows with intermediate storage restrictions," European Journal of Operational Research, Elsevier, vol. 165(2), pages 495-509, September.
  20. M. Vanhoucke, 2004. "Work Continuity Constraints In Project Scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/265, Ghent University, Faculty of Economics and Business Administration.
  21. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
  22. Bert De Reyck & Erik Demeulemeester & Willy Herroelen, 1998. "Local search methods for the discrete time/resource trade‐off problem in project networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 553-578, September.
  23. Guidong Zhu & Jonathan F. Bard & Gang Yu, 2006. "A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 377-390, August.
  24. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
  25. Raphael Kramer & Mauro Dell’Amico & Manuel Iori, 2017. "A batching-move iterated local search algorithm for the bin packing problem with generalized precedence constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6288-6304, November.
  26. M. Vanhoucke, 2006. "An efficient hybrid search algorithm for various optimization problems," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/365, Ghent University, Faculty of Economics and Business Administration.
  27. Aidin Delgoshaei & Timon Rabczuk & Ahad Ali & Mohd Khairol Anuar Ariffin, 2017. "An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources," Annals of Operations Research, Springer, vol. 259(1), pages 85-117, December.
  28. Kai Watermeyer & Jürgen Zimmermann, 2022. "A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 575-602, June.
  29. Zhou, Xuesong & Zhong, Ming, 2007. "Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds," Transportation Research Part B: Methodological, Elsevier, vol. 41(3), pages 320-341, March.
  30. Chen, Jiaqiong & Askin, Ronald G., 2009. "Project selection, scheduling and resource allocation with time dependent returns," European Journal of Operational Research, Elsevier, vol. 193(1), pages 23-34, February.
  31. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
  32. Neumann, K. & Zimmermann, J., 2000. "Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints," European Journal of Operational Research, Elsevier, vol. 127(2), pages 425-443, December.
  33. Kimms, Alf, 1999. "Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 504, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  34. Xiaowei Lin & Jing Zhou & Lianmin Zhang & Yinlian Zeng, 2021. "Revenue sharing for resource reallocation among project activity contractors," Annals of Operations Research, Springer, vol. 301(1), pages 121-141, June.
  35. Jan-Hendrik Bartels & Thorsten Gather & Jürgen Zimmermann, 2011. "Dismantling of nuclear power plants at optimal NPV," Annals of Operations Research, Springer, vol. 186(1), pages 407-427, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.