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

A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem

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. M. Vanhoucke & J. Coelho & L. V. Tavares & D. Debels, 2004. "On The Morphological Structure Of A Network," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/272, Ghent University, Faculty of Economics and Business Administration.
  3. Rainer Kolisch & Andreas Drexl, 1996. "Adaptive search for solving hard project scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(1), pages 23-40, February.
  4. 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.
  5. 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.
  6. Cui, Nanfang & Demeulemeester, Erik & Bie, Li, 2016. "Incorporation of activity sensitivity measures into buffer management to manage project schedule riskAuthor-Name: Hu, Xuejun," European Journal of Operational Research, Elsevier, vol. 249(2), pages 717-727.
  7. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
  8. De Reyck, Bert & Herroelen, Willy, 1996. "On the use of the complexity index as a measure of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 347-366, June.
  9. Tsai, Ying-Wei & D. Gemmill, Douglas, 1998. "Using tabu search to schedule activities of stochastic resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 111(1), pages 129-141, November.
  10. Rema Padman & Dwight E. Smith‐Daniels & Vicki L. Smith‐Daniels, 1997. "Heuristic scheduling of resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 365-381, June.
  11. Osman Hürol Türkakın & David Arditi & Ekrem Manisalı, 2021. "Comparison of Heuristic Priority Rules in the Solution of the Resource-Constrained Project Scheduling Problem," Sustainability, MDPI, vol. 13(17), pages 1-17, September.
  12. Van Eynde, Rob & Vanhoucke, Mario, 2022. "New summary measures and datasets for the multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(3), pages 853-868.
  13. Drexl, Andreas & Frahm, Johannes & Salewski, Frank, 1997. "Audit-staff scheduling by column generation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 464, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  14. Sönke Hartmann, 2002. "A self‐adapting genetic algorithm for project scheduling under resource constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(5), pages 433-448, August.
  15. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
  16. Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "Modelling setup times, process batches and transfer batches using activity network logic," European Journal of Operational Research, Elsevier, vol. 89(2), pages 355-365, March.
  17. Abdul Razaque & Christian Bach & Nyembo salama & Aziz Alotaibi, 2012. "Fostering Project Scheduling and Controlling Risk Management," Papers 1210.2021, arXiv.org.
  18. Luh, Peter B. & Liu, Feng & Moser, Bryan, 1999. "Scheduling of design projects with uncertain number of iterations," European Journal of Operational Research, Elsevier, vol. 113(3), pages 575-592, March.
  19. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
  20. Kolisch, Rainer & Hempel, Kai, 1995. "Experimentelle Evaluation der methodischen Fundierung von Projektmanagementsoftware," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 372, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  21. Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
  22. 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.
  23. 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.
  24. Wiley, Victor D. & Deckro, Richard F. & Jackson, Jack A., 1998. "Optimization analysis for design and planning of multi-project programs," European Journal of Operational Research, Elsevier, vol. 107(2), pages 492-506, June.
  25. Salewski, Frank & Schirmer, Andreas & Drexl, Andreas, 1996. "Project Scheduling under Resource and Mode Identity Constraints. Part II: An Application to Audit-Staff Scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 388, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  26. 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.
  27. 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.
  28. Ballestí­n, Francisco & Valls, Vicente & Quintanilla, Sacramento, 2008. "Pre-emption in resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1136-1152, September.
  29. Samaddar, Subhashish & Rabinowitz, Gad & Zhang, Guoqiang Peter, 2005. "An experimental analysis of solution performance in a resource sharing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 139-156, August.
  30. Krüger, Doreen & Scholl, Armin, 2009. "A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times," European Journal of Operational Research, Elsevier, vol. 197(2), pages 492-508, September.
  31. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
  32. 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.
  33. 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.
  34. 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.
  35. 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.
  36. Schirmer, Andreas & Riesenberg, Sven, 1998. "Class-based control schemes for parameterized project scheduling heuristics," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 471, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  37. Kolisch, Rainer & Hempel, Kai, 1996. "Finite scheduling capabilities of commercial project management systems," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 397, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  38. Yanfen Zhang & Jinyao Ma & Haibin Zhang & Bin Yue, 2023. "Platform Resource Scheduling Method Based on Branch-and-Bound and Genetic Algorithm," Annals of Data Science, Springer, vol. 10(5), pages 1421-1445, October.
  39. Kolisch, Rainer & Sprecher, Arno, 1997. "PSPLIB - A project scheduling problem library : OR Software - ORSEP Operations Research Software Exchange Program," European Journal of Operational Research, Elsevier, vol. 96(1), pages 205-216, January.
  40. 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.
  41. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
  42. Hartmann, Sönke, 1999. "Self-adapting genetic algorithms with an application to project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 506, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  43. Alessandro Hill & Andrea J. Brickey & Italo Cipriano & Marcos Goycoolea & Alexandra Newman, 2022. "Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3042-3058, November.
  44. Kolisch, Rainer & Drexl, Andreas, 1994. "Hybrid biased random sampling for multiple resourse-constrained project scheduling problems," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 354, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  45. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
  46. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
  47. Ozdamar, Linet & Ulusoy, Gunduz, 1996. "A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis," European Journal of Operational Research, Elsevier, vol. 89(2), pages 400-407, March.
  48. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
  49. 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.
  50. Colin E. Bell & Kwangho Park, 1990. "Solving resource‐constrained project scheduling problems by a* search," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 61-84, February.
  51. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
  52. Pfeifer, Jeremy & Barker, Kash & Ramirez-Marquez, Jose E. & Morshedlou, Nazanin, 2015. "Quantifying the risk of project delays with a genetic algorithm," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 34-44.
  53. 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.
  54. Yan Zhao & Nanfang Cui & Wendi Tian, 2020. "A two-stage approach for the critical chain project rescheduling," Annals of Operations Research, Springer, vol. 285(1), pages 67-95, February.
  55. Buddhakulsomsiri, Jirachai & Kim, David S., 2006. "Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 175(1), pages 279-295, November.
  56. Tavares, L. V., 2002. "A review of the contribution of Operational Research to Project Management," European Journal of Operational Research, Elsevier, vol. 136(1), pages 1-18, January.
  57. Rainer Kolisch, 1999. "Resource Allocation Capabilities of Commercial Project Management Software Packages," Interfaces, INFORMS, vol. 29(4), pages 19-31, August.
  58. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
  59. Dan Zhu & Rema Padman, 1999. "A metaheuristic scheduling procedure for resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(8), pages 912-927, December.
  60. Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 334-348, April.
  61. 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.
  62. Creemers, Stefan, 2019. "The preemptive stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 238-247.
  63. 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.
  64. Dayal Madhukar & Verma, Sanjay, 2014. "Breadth-first and Best-first Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2014-10-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
  65. Jae Kyu Lee & Hyung Rim Choi & Ok Ryul Yang & Ho Dong Kim, 1994. "Scheduling Shipbuilding Using a Constraint Directed Graph Search: DAS‐ERECT," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 3(2), pages 111-125, April.
  66. M K Ahsan & D-b Tsao, 2003. "A comment on solving project-scheduling problems with a heuristic learning algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(6), pages 666-668, June.
  67. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.
  68. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
  69. Tukel, Oya I. & Rom, Walter O. & Eksioglu, Sandra Duni, 2006. "An investigation of buffer sizing techniques in critical chain scheduling," European Journal of Operational Research, Elsevier, vol. 172(2), pages 401-416, July.
  70. 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.
  71. Klein, Robert, 2000. "Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 127(3), pages 619-638, December.
  72. Jozefowska, Joanna & Weglarz, Jan, 1998. "On a methodology for discrete-continuous scheduling," European Journal of Operational Research, Elsevier, vol. 107(2), pages 338-353, June.
  73. Zahid, Taiba & Kühn, Mathias & Völker, Michael & Schmidt, Thorsten, 2015. "Investigation of Scheduling Techniques for Uncertain Conditions," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Blecker, Thorsten & Kersten, Wolfgang & Ringle, Christian M. (ed.), Operational Excellence in Logistics and Supply Chains: Optimization Methods, Data-driven Approaches and Security Insights. Proceedings of the Hamburg , volume 22, pages 171-202, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
  74. 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.
  75. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
  76. 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.
  77. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
  78. Nazareth, Terence & Verma, Sanjay & Bhattacharya, Subir & Bagchi, Amitava, 1999. "The multiple resource constrained project scheduling problem: A breadth-first approach," European Journal of Operational Research, Elsevier, vol. 112(2), pages 347-366, January.
  79. 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.
  80. Carlier, Jacques & Neron, Emmanuel, 2000. "A new LP-based lower bound for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 363-382, December.
  81. Fleszar, Krzysztof & Hindi, Khalil S., 2004. "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 155(2), pages 402-413, June.
  82. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.