IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-0-387-33768-5_8.html
   My bibliography  Save this book chapter

Justification Technique Generalizations

In: Perspectives in Modern Project Scheduling

Author

Listed:
  • Vicente Valls

    (Universitat de Valencia)

  • Francisco Ballestín

    (Universidad Pública de Navarra)

  • Sacramento Quintanilla

    (Universitat de Valencia)

Abstract

The justification technique was introduced various decades ago for the resource-constrained project scheduling problem, although it has rarely been used with the problem. Justification is a simple and quick technique which when applied to schedules produces a new schedule that is, at most, as long as the original schedule — and often shorter. A recent article (Valls et al, 2005), showed that incorporating justification in heuristic algorithms can produce a substancial improvement in the results obtained. These results have motivated us to generalise this technique in order to study it in greater depth. This paper proposes distinct forms and generalisations for the justification technique and studies the relation existing among sets of obtainable schedules. The obtained results show that the proposed generalisations are worthwhile. Several computational tests have been performed to ascertain the impact of the generalisations on algorithmic efficiency.

Suggested Citation

  • Vicente Valls & Francisco Ballestín & Sacramento Quintanilla, 2006. "Justification Technique Generalizations," International Series in Operations Research & Management Science, in: Joanna Józefowska & Jan Weglarz (ed.), Perspectives in Modern Project Scheduling, chapter 0, pages 205-223, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-33768-5_8
    DOI: 10.1007/978-0-387-33768-5_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:isochp:978-0-387-33768-5_8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.