Advanced Search
MyIDEAS: Login to save this paper or follow this series

Scheduling projects with labor constraints

Contents:

Author Info

  • CAVALCANTE, Cristina C.B.

    (Instituto de Computacao, Universidade Estadual de Campinas — UNICAMP, Caixa Postal 6176 – CEP: 13083-970 – Campinas, SP – Brazil)

  • CARVALHO DE SOUZA, Cid

    (Instituto de Computacao, Universidade Estadual de Campinas — UNICAMP, Caixa Postal 6176 – CEP: 13083-970 – Campinas, SP – Brazil)

  • SAVELSBERGH, Martin W.P.

    (School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA)

  • WANG, Yaoguang

    (Navigation Technologies, 10400 W. Higgins Road, Rosemont, IL 60018)

Registered author(s):

    Abstract

    In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirement varies as the job is processed. Given the amount of labor available in each period, the problem is to finish all the jobs as soon as possible, that is, to minimize makespan, subject to the precedence and labor constraints. Several Integer Programming (IP) formulations for this problem are discussed and valid inequalities for these different models are introduced. It turns out that a major drawback in using the IP approach is the weakness of the lower bound relaxations. However, we report computational experiments showing how the solution of the linear relaxation of the IP models can be used to provide good schedules. Solutions arising from these LP-based heuristics are considerably improved by local search procedures. We further exploit the capabilities of local search for LCSP by designing a Tabu Search algorithm. The computational experiments on a benchmark data set show that the Tabu algorithm generates the best known upper bounds for almost all these instances. We also show how IP can be used to provide reasonably good lower bounds for LCSP when the makespan is replaced by suitably modified objective functions. Finally some directions for further investigations which may turn IP techniques into a more interesting tool for solving such a problem are suggested.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://alfresco.uclouvain.be/alfresco/download/attach/workspace/SpacesStore/552e5322-2ce5-439c-b49a-9a7af15933ba/coredp_1998_59.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 1998059.

    as in new window
    Length:
    Date of creation: 01 Sep 1998
    Date of revision:
    Handle: RePEc:cor:louvco:1998059

    Contact details of provider:
    Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)
    Phone: 32(10)474321
    Fax: +32 10474304
    Email:
    Web page: http://www.uclouvain.be/core
    More information through EDIRC

    Related research

    Keywords: Pro ject Scheduling; Labor Constraints; Integer Programming; Valid Inequalities; Tabu Search; LP-based Ordering Heuristics;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:cor:louvco:1998059. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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