IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1520.html
   My bibliography  Save this paper

Scheduling projects with labor constraints

Author

Listed:
  • CAVALCANTE, C.C.B.
  • CARVALHO DE SOUZA, C.
  • SAVELSBERGH, M.W.P.
  • WANG , Y.

Abstract

No abstract is available for this item.

Suggested Citation

  • Cavalcante, C.C.B. & Carvalho De Souza, C. & Savelsbergh, M.W.P. & Wang , Y., 2001. "Scheduling projects with labor constraints," LIDAM Reprints CORE 1520, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1520
    DOI: 10.1016/S0166-218X(00)00308-5
    Note: In : Discrete Applied Mathematics, 112, 27-52, 2001
    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. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
    2. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    3. de Azevedo, Guilherme Henrique Ismael & Pessoa, Artur Alves & Subramanian, Anand, 2021. "A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints," European Journal of Operational Research, Elsevier, vol. 289(3), pages 809-824.
    4. Adrian Zimmermann & Norbert Trautmann, 2018. "A list-scheduling heuristic for the short-term planning of assessment centers," Journal of Scheduling, Springer, vol. 21(2), pages 131-142, April.
    5. Martin W. P. Savelsbergh & R. N. Uma & Joel Wein, 2005. "An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 123-136, February.

    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:cor:louvrp:1520. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.