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

RCPS with Variable Intensity Activities and Feeding Precedence Constraints

In: Perspectives in Modern Project Scheduling

Author

Listed:
  • Tamás Kis

    (Hungarian Academy of Sciences)

Abstract

This paper presents a branch-and-cut based exact solution algorithm for scheduling of projects with variable intensity activities connected by feeding precedence constraints the objective being to minimize the violation of resource constraints. Feeding precedence constraints allow some overlap in the execution of the connected activities and capture the flow of material or information between them. New polyhedral results are obtained and computational results are summarized.

Suggested Citation

  • Tamás Kis, 2006. "RCPS with Variable Intensity Activities and Feeding Precedence Constraints," International Series in Operations Research & Management Science, in: Joanna Józefowska & Jan Weglarz (ed.), Perspectives in Modern Project Scheduling, chapter 0, pages 105-129, Springer.
    • Handle: RePEc:spr:isochp:978-0-387-33768-5_5
    DOI: 10.1007/978-0-387-33768-5_5
    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.

    Citations

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


    Cited by:

    1. 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.
    2. Georges Baydoun & Alain Haït & Robert Pellerin & Bernard Clément & Guillaume Bouvignies, 2016. "A rough-cut capacity planning model with overlapping," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(2), pages 335-364, March.
    3. Quintanilla, Sacramento & Pérez, Ángeles & Lino, Pilar & Valls, Vicente, 2012. "Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres," European Journal of Operational Research, Elsevier, vol. 219(1), pages 59-72.

    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_5. 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.