# A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

## Author Info

• Edward Sewell

()

• Jason Sauppe

()

• David Morrison

()

• Sheldon Jacobson

()

• Gio Kao

()

Registered author(s):

## Abstract

This paper presents a Branch, Bound, and Remember (BB&R) exact algorithm using the Cyclic Best First Search (CBFS) exploration strategy for solving the $${1|ST_{sd}|\sum T_{i}}$$ scheduling problem, a single machine scheduling problem with sequence dependent setup times where the objective is to find a schedule with minimum total tardiness. The BB&R algorithm incorporates memory-based dominance rules to reduce the solution search space. The algorithm creates schedules in the reverse direction for problems where fewer than half the jobs are expected to be tardy. In addition, a branch and bound algorithm is used to efficiently compute tighter lower bounds for the problem. This paper also presents a counterexample for a previously reported exact algorithm in Luo and Chu (Appl Math Comput 183(1):575–588, 2006 ) and Luo et al. (Int J Prod Res 44(17):3367–3378, 2006 ). Computational experiments demonstrate that the algorithm is two orders of magnitude faster than the fastest exact algorithm that has appeared in the literature. Computational experiments on two sets of benchmark problems demonstrate that the CBFS search exploration strategy can be used as an effective heuristic on problems that are too large to solve to optimality. Copyright Springer Science+Business Media, LLC. 2012

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://hdl.handle.net/10.1007/s10898-011-9793-z

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

## Bibliographic Info

Article provided by Springer in its journal Journal of Global Optimization.

Volume (Year): 54 (2012)
Issue (Month): 4 (December)
Pages: 791-812

as in new window
Handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:791-812

Contact details of provider:

Order Information:

## Related research

Keywords: Branch and bound algorithms; Scheduling theory and algorithms; Dynamic programming; Dominance rules;

## References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
1. Tan, K. C. & Narasimhan, R., 1997. "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach," Omega, Elsevier, vol. 25(6), pages 619-634, December.
2. Gupta, Skylab R. & Smith, Jeffrey S., 2006. "Algorithms for single machine total tardiness scheduling with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 175(2), pages 722-739, December.
3. Luo, Xiaochuan & Chu, Chengbin, 2007. "A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness," European Journal of Operational Research, Elsevier, vol. 180(1), pages 68-81, July.
Full references (including those not matched with items on IDEAS)

## Lists

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

## Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:54:y:2012:i:4:p:791-812. 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: (Guenther Eichhorn) or (Christopher F Baum).

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.