Skip to main content
SpringerLink
Log in

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In the design of exact methods for NP-hard machine scheduling problems, branch and bound algorithms have always been widely considered. In this work we revisit the classic search strategies for branch and bound schemes. We consider a systematic application of the well known dynamic programming dominance property for machine scheduling problems. Several conditions concerning the application of the proposed property with respect to best first, depth first, breadth first search strategies and problem characteristics are presented. Computational testing on single machine and flow shop problems validate in practice the efficiency of the considered approach and suggest that the traditional choice of depth first search with respect to best first and breadth first is strongly questionable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • Chu, C.,” Abranch-and-bound algorithm to minimize total. owtime with unequal release dates,” Naval Research Logistics, 39, 859-875 (1992).

    Google Scholar 

  • Della Croce, F., M. Ghirardi, and R. Tadei,” An improved branch and bound algorithm for the two-machine total completion time Flow Shop problem,” European Journal of Operational Research, 139, 293-301 (2002).

    Google Scholar 

  • Pan, Y.,” Animproved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time,” Operations Research Letters, 31, 492-496 (2003).

    Google Scholar 

  • Posner, M.,” Minimizing weighted completion times with deadlines,” Operations Research, 33, 562-574 (1985).

    Google Scholar 

  • Potts, C. N. and L. N. Van Wassenhove,” An algorithm for single machine sequencing with deadlines to minimize total weighted completion time,” European Journal of Operational Research, 12, 379-387 (1983).

    Google Scholar 

  • Potts, C. N. and L. N. Van Wassenhove,” A branch and bound algorithm for the total weighted tardiness problem,” Operations Research, 33, 363-377 (1985).

    Google Scholar 

  • Schrage, L. and K. R. Baker,” Dynamic programming solution of sequencing problems with precedence constraints,” Operations Research, 26, 444-449 (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Université de Tours, Tours, France

    V. T'kindt & C. Esswein

  2. DAI, Politecnico di Torino, Torino, Italy

    F. Della Croce

Authors
  1. V. T'kindt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Della Croce
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Esswein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. T'kindt.

Rights and permissions

Reprints and permissions

About this article

Cite this article

T'kindt, V., Croce, F.D. & Esswein, C. Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. Journal of Scheduling 7, 429–440 (2004). https://doi.org/10.1023/B:JOSH.0000046075.73409.7d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOSH.0000046075.73409.7d

Search

Navigation