IDEAS home Printed from https://ideas.repec.org/a/igg/jitpm0/v2y2011i4p1-13.html
   My bibliography  Save this article

Using a Sliding-Frame Approach for Scheduling Large and Complex IT Projects

Author

Listed:
  • Yuval Cohen

    (Open University and Afeka Academic College, Israel)

  • Ofer Zwikael

    (Australian National University, Australia)

  • Arik Sadeh

    (Holon Institute of Technology, Israel)

Abstract

Many IT projects and software development projects are very complex and sophisticated involving a large coordinated team. Such projects are a constant part of the operations of software companies such as Microsoft, SAP, Oracle, Google, Yahoo, IBM, and others. Many other companies carry large software projects as part of their IT operations. As a result of the size and complexity of such projects, a rolling horizon approach for their planning and management is not only plausible but also desirable. For large projects, traditional project scheduling techniques cannot provide an optimal and timely solution to minimum project duration under precedence and resource constraints. This paper proposes a technique that allows utilizing non-polynomial (NP) algorithms in a heuristic manner – generating high quality schedules in reasonable time. This approach can be applied efficiently for solving most project scheduling problems. The main advantage of this approach is its ability to dissect the original problem into small sub-problems of a controllable size to which exact techniques can be applied. Thus, it neutralizes the complexity of the applied algorithms (and their non-polynomial growth). Moreover, the same technique could be used for implementing a rolling-horizon approach in project planning and management.

Suggested Citation

  • Yuval Cohen & Ofer Zwikael & Arik Sadeh, 2011. "Using a Sliding-Frame Approach for Scheduling Large and Complex IT Projects," International Journal of Information Technology Project Management (IJITPM), IGI Global, vol. 2(4), pages 1-13, October.
    • Handle: RePEc:igg:jitpm0:v:2:y:2011:i:4:p:1-13
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jitpm.2011100101
    Download Restriction: no
    ---><---

    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:igg:jitpm0:v:2:y:2011:i:4:p:1-13. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.