Skip to main content
SpringerLink
Log in

A new branch and bound algorithm for minimizing the weighted number of tardy jobs

  • Methodology
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, the problem of sequencing jobs on a single machine to minimize the weighted number of tardy jobs is considered. Some new dominances between jobs are proposed and studied. A new branch and bound algorithm that can solve large problems, e.g. 85 jobs, is presented.

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

  1. K.R. Baker and J.B. Martin, An experimental comparison of solution algorithms for the singlemachine tardiness problem, Naval Res. Logistics Quart. 21(1974)187–199.

    Google Scholar 

  2. M.L. Fisher, A dual algorithm for the one-machine scheduling problem, Math. Progr. 11(1976)229–251.

    Google Scholar 

  3. R.L. Graham, E.L. Lawler, J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, Ann. Discr. Math. 5(1979)287–326.

    Google Scholar 

  4. W. Huang and G. Tang, A branch and bound approach to minimizing the weighted number of tardy jobs, Acta Math. Appl. Sinica, to appear.

  5. R.M. Karp, Reducibility among combinatorial algorithms, in:Complexity of Computer Computations, ed. R.E. Miller and J.W. Thatcher (Plenum, New York, 1972), pp. 85–103.

    Google Scholar 

  6. E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Manag. Sci. 16(1969)77–84.

    Google Scholar 

  7. H. Matsuo and G. Tang, Worst case and empirical analysis of local search heuristics for the onemachine total tardiness problem, Preprint, Graduate School of Business, University of Texas at Austin (1986).

  8. A.H.G. Rinnooy Kan, B.J. Lageweg and J.K. Lenstra, Minimizing total costs in one-machine scheduling, Oper. Res. 23(1975)908–927.

    Google Scholar 

  9. S. Sahni, Algorithms for scheduling independent tasks, J. ACM 23(1976)116–127.

    Google Scholar 

  10. G. Tang and L. Tao, Empirical analysis of the branch and bound algorithm for minimizing the weighted number of tardy jobs, J. Shanghai Second Polytechnic University, to appear.

  11. L. Tao and G. Tang, A note on Emmons conditions about tardiness problems, J. Qufu Normal University 3(1988)88–94.

    Google Scholar 

  12. F.J. Villarreal, Scheduling a single machine to minimize the weighted number of tardy jobs, IIE Trans. (1983)337–343.

Download references

Author information

Authors and Affiliations

  1. Shanghai Second Polytechnic University, Shanghai, P.R. China

    Guochun Tang

Authors
  1. Guochun Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, G. A new branch and bound algorithm for minimizing the weighted number of tardy jobs. Ann Oper Res 24, 225–232 (1990). https://doi.org/10.1007/BF02216825

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02216825

Keywords

Search

Navigation