IDEAS home Printed from
   My bibliography  Save this paper

An exact approach for single machine scheduling with quadratic earliness and tardiness penalties


  • Jorge M. S. Valente

    () (LIACC/NIAAD, Faculdade de Economia, Universidade do Porto, Portugal)


In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose two different lower bounds, as well as a lower bounding procedure that combines these two bounds. Optimal branch-and-bound algorithms are then presented. These algorithms incorporate the proposed lower bound, as well as an insertion-based dominance test. The lower bounding procedure and the branch-and-bound algorithms are tested on a wide set of randomly generated problems. The computational results show that the branch-and-bound algorithms are capable of optimally solving, within reasonable computation times, instances with up to 20 jobs.

Suggested Citation

  • Jorge M. S. Valente, 2007. "An exact approach for single machine scheduling with quadratic earliness and tardiness penalties," FEP Working Papers 238, Universidade do Porto, Faculdade de Economia do Porto.
  • Handle: RePEc:por:fepwps:238

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Romer, Paul M, 1990. "Endogenous Technological Change," Journal of Political Economy, University of Chicago Press, vol. 98(5), pages 71-102, October.
    2. Antonelli, Cristiano, 2001. "The Microeconomics of Technological Systems," OUP Catalogue, Oxford University Press, number 9780199245536, June.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Jorge M. S. Valente, 2008. "Beam search heuristics for quadratic earliness and tardiness scheduling," FEP Working Papers 279, Universidade do Porto, Faculdade de Economia do Porto.

    More about this item


    scheduling; single machine; quadratic earliness and tardiness; lower bounds; branch-and-bound;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:por:fepwps:238. 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: (). 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.