IDEAS home Printed from
   My bibliography  Save this paper

Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups


  • Jorge M. S. Valente

    () (Faculdade de Economia, Universidade do Porto)


In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Previous beam search implementations use fixed beam and filter widths. We consider the usual fixed width algorithms, and develop new versions that use variable beam and filter widths. Two new improvement procedures, based on adjacent pairwise interchanges and 3-swaps, are also presented. The computational results show that the beam search versions with a variable width are marginally superior to their fixed value counterparts, even when a lower average number of beam and filter nodes is used. The best results are given by the filtered beam search algorithms. For large problems, however, these procedures require excessive computation times. The priority beam search algorithms are much faster, and can therefore be used for the largest instances. The 3-swap method is the best of the improvement procedures, giving the largest relative improvement and decreasing the total cost for a larger number of instances.

Suggested Citation

  • Jorge M. S. Valente, 2005. "Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups," FEP Working Papers 186, Universidade do Porto, Faculdade de Economia do Porto.
  • Handle: RePEc:por:fepwps:186

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Jon K. Wilbrecht & William B. Prescott, 1969. "The Influence of Setup Time on Job Shop Performance," Management Science, INFORMS, vol. 16(4), pages 274-280, December.
    2. Raman, Narayan & Rachamadugu, Ram V. & Talbot, F. Brian, 1989. "Real-time scheduling of an automated manufacturing center," European Journal of Operational Research, Elsevier, vol. 40(2), pages 222-242, May.
    3. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    4. Sen, Tapan & Sulek, Joanne M. & Dileepan, Parthasarati, 2003. "Static scheduling research to minimize weighted and unweighted tardiness: A state-of-the-art survey," International Journal of Production Economics, Elsevier, vol. 83(1), pages 1-12, January.
    5. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    6. Lee, Young Hoon & Pinedo, Michael, 1997. "Scheduling jobs on parallel machines with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 100(3), pages 464-474, August.
    Full references (including those not matched with items on IDEAS)

    More about this item


    scheduling; weighted tardiness; sequence-dependent setups; beam search;

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

    If CitEc recognized a reference but did not link an item in RePEc 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 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.