IDEAS home Printed from https://ideas.repec.org/r/inm/ormnsc/v24y1978i11p1163-1174.html
   My bibliography  Save this item

An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems

Citations

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


Cited by:

  1. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  2. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
  3. Shewchuk, John P. & Chang, T. C., 1995. "Resource-constrained job scheduling with recyclable resources," European Journal of Operational Research, Elsevier, vol. 81(2), pages 364-375, March.
  4. 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.
  5. 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.
  6. Sprecher, Arno & Drexl, Andreas, 1996. "Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequeacing Algorithm. Part I: Theory," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 385, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  7. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
  8. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
  9. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
  10. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
  11. Blazewicz, Jacek & Kobler, Daniel, 2002. "Review of properties of different precedence graphs for scheduling problems," European Journal of Operational Research, Elsevier, vol. 142(3), pages 435-443, November.
  12. Scott E. Sampson & Elliott N. Weiss, 1993. "Local search techniques for the generalized resource constrained project scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 665-675, August.
  13. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part I: Model, Complexity Status, and Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 387, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  14. Sprecher, Arno, 1998. "Non-equivalent search strategies for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 493, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  15. Schirmer, Andreas & Drexl, Andreas, 1997. "Allocation of partially renewable resources: Concept, models and applications," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 455, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  16. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
  17. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
  18. Kreter, Stefan & Rieck, Julia & Zimmermann, Jürgen, 2016. "Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars," European Journal of Operational Research, Elsevier, vol. 251(2), pages 387-403.
  19. Schirmer, Andreas, 1999. "Fast iterative improvement methods for project scheduling under partially renewable resources," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 501, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  20. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
  21. Norbis, Mario & MacGregor Smith, J., 1996. "An interactive decision support system for the resource Constrained Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 94(1), pages 54-65, October.
  22. Elmaghraby, Salah E., 1995. "Activity nets: A guided tour through some recent developments," European Journal of Operational Research, Elsevier, vol. 82(3), pages 383-408, May.
  23. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  24. Hartmann, Sönke & Drexl, Andreas, 1997. "Project scheduling with multiple modes: A comparison of exact algorithms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 430, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  25. Thomas Selle & Jürgen Zimmermann, 2003. "A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 130-148, March.
  26. Frank Schultmann & Otto Rentz, 2002. "Scheduling of deconstruction projects under resource constraints," Construction Management and Economics, Taylor & Francis Journals, vol. 20(5), pages 391-401.
  27. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
  28. S. Selcuk Erenguc & Taeho Ahn & Daniel G. Conway, 2001. "The resource constrained project scheduling problem with multiple crashable modes: An exact solution method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(2), pages 107-127, March.
  29. Androutsopoulos, Konstantinos N. & Manousakis, Eleftherios G. & Madas, Michael A., 2020. "Modeling and solving a bi-objective airport slot scheduling problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 135-151.
  30. Sprecher, Arno & Drexl, Andreas, 1998. "Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm," European Journal of Operational Research, Elsevier, vol. 107(2), pages 431-450, June.
  31. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  32. Ahn, Taeho & Erenguc, S. Selcuk, 1998. "The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 107(2), pages 250-259, June.
  33. Kai Watermeyer & Jürgen Zimmermann, 2023. "A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints," Journal of Scheduling, Springer, vol. 26(1), pages 95-111, February.
  34. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  35. Schirmer, Andreas, 1999. "Adaptive control schemes applied to project scheduling with partially renewable resources," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 520, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  36. Javier Castro & Daniel Gómez & Juan Tejada, 2014. "Allocating slacks in stochastic PERT network," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(1), pages 37-52, March.
  37. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1997. "Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application," European Journal of Operational Research, Elsevier, vol. 102(1), pages 88-110, October.
  38. Colin E. Bell & Jaemin Han, 1991. "A new heuristic solution method in resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 315-331, June.
  39. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
  40. Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
  41. Ulusoy, Gunduz & Ozdamar, Linet, 1996. "A framework for an interactive project scheduling system under limited resources," European Journal of Operational Research, Elsevier, vol. 90(2), pages 362-375, April.
  42. 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.
  43. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  44. Yang, Kum Khiong & Tay, Lee Choo & Sum, Chee Chuong, 1995. "A comparison of stochastic scheduling rules for maximizing project net present value," European Journal of Operational Research, Elsevier, vol. 85(2), pages 327-339, September.
  45. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
  46. Drexl, Andreas & Grünewald, Jürgen, 1989. "Nonpreemptive multi-mode resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 236, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  47. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1993. "Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 307, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  48. Mareike Karnebogen & Jürgen Zimmermann, 2024. "Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints," Annals of Operations Research, Springer, vol. 338(1), pages 173-192, July.
  49. Yang, Kum-Khiong, 1998. "A comparison of dispatching rules for executing a resource-constrained project with estimated activity durations," Omega, Elsevier, vol. 26(6), pages 729-738, December.
  50. Sprecher, Arno, 1997. "A competitive exact algorithm for assembly line balancing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 449, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  51. Sprecher, Arno, 1996. "Solving the RCPSP efficiently at modest memory requirements," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 425, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.