IDEAS home Printed from
   My bibliography  Save this paper

Scheduling projects with labor constraints


  • CAVALCANTE, Cristina C.B.

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


    (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)


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.

Suggested Citation

  • CAVALCANTE, Cristina C.B. & CARVALHO DE SOUZA, Cid & SAVELSBERGH, Martin W.P. & WANG, Yaoguang, 1998. "Scheduling projects with labor constraints," CORE Discussion Papers 1998059, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:1998059

    Download full text from publisher

    File URL:
    Download Restriction: no


    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: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). General contact details of provider: .

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

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.