IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v107y1998i2p492-506.html
   My bibliography  Save this article

Optimization analysis for design and planning of multi-project programs

Author

Listed:
  • Wiley, Victor D.
  • Deckro, Richard F.
  • Jackson, Jack A.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:107:y:1998:i:2:p:492-506
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00334-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Deckro, RF & Hebert, JE, 1989. "Resource constrained project crashing," Omega, Elsevier, vol. 17(1), pages 69-79.
    2. Demeulemeester, Erik & Herroelen, Willy & Simpson, Wendell P. & Baroum, Sami & Patterson, James H. & Yang, Kum-Khiong, 1994. "On a paper by Christofides et al. for solving the multiple-resource constrained, single project scheduling problem," European Journal of Operational Research, Elsevier, vol. 76(1), pages 218-228, July.
    3. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    4. Arthur M. Geoffrion, 1976. "The Purpose of Mathematical Programming is Insight, Not Numbers," Interfaces, INFORMS, vol. 7(1), pages 81-92, November.
    5. Deckro, RF & Hebert, JE & Verdini, WA, 1992. "Project scheduling with work packages," Omega, Elsevier, vol. 20(2), pages 169-182, March.
    6. William J. Baumol & Tibor Fabian, 1964. "Decomposition, Pricing for Decentralization and External Economies," Management Science, INFORMS, vol. 11(1), pages 1-32, September.
    7. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    8. Vercellis, Carlo, 1994. "Constrained multi-project plannings problems: A Lagrangean decomposition approach," European Journal of Operational Research, Elsevier, vol. 78(2), pages 267-275, October.
    9. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    10. Deckro, Richard F. & Winkofsky, E. P. & E. Hebert, John & Gagnon, Roger, 1991. "A decomposition approach to multi-project scheduling," European Journal of Operational Research, Elsevier, vol. 51(1), pages 110-118, March.
    11. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Lova, Antonio & Maroto, Concepcion & Tormos, Pilar, 2000. "A multicriteria heuristic method to improve resource allocation in multiproject scheduling," European Journal of Operational Research, Elsevier, vol. 127(2), pages 408-424, December.
    2. Ray R. Hashemi & Louis A. Le Blanc, 2000. "Resource Allocation through Negotiation and Compromise: A Database Approach," Group Decision and Negotiation, Springer, vol. 9(4), pages 325-345, July.
    3. 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.
    4. Tien-Fu Liang & Tien-Shou Huang & Ming-Feng Yang, 2012. "Application of fuzzy mathematical programming to imprecise project management decisions," Quality & Quantity: International Journal of Methodology, Springer, vol. 46(5), pages 1451-1470, August.
    5. Chen, Chung-Yang & Liu, Heng-An & Song, Je-Yi, 2013. "Integrated projects planning in IS departments: A multi-period multi-project selection and assignment approach with a computerized implementation," European Journal of Operational Research, Elsevier, vol. 229(3), pages 683-694.
    6. Joosung Lee & Jaejun Kim, 2017. "BIM-Based 4D Simulation to Improve Module Manufacturing Productivity for Sustainable Building Projects," Sustainability, MDPI, vol. 9(3), pages 1-23, March.
    7. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. 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.
    3. 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.
    4. 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.
    5. Rainer Kolisch, 1999. "Resource Allocation Capabilities of Commercial Project Management Software Packages," Interfaces, INFORMS, vol. 29(4), pages 19-31, August.
    6. 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.
    7. 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.
    8. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    9. 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.
    10. 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.
    11. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    12. 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.
    13. 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.
    14. 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.
    15. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:107:y:1998:i:2:p:492-506. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.