Skip to main content
SpringerLink
Log in

Simple heuristic to minimize total tardiness in a single machine scheduling problem

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

This paper discusses a simple heuristic to minimize the total tardiness in a single machine scheduling problem. The problem of minimizing total tardiness in single machine scheduling is a combinatorial problem. Hence, heuristic development for such problems is inevitable. In this paper, an attempt has been made to develop a simple heuristic, alternatively called greedy heuristic, to minimize the total tardiness in a single machine scheduling problem with n independent jobs, each having its processing time and due date. Further, its solution accuracy is compared with the optimal solution of a set of randomly generated problems using an ANOVA experiment. From the ANOVA experiment, it is observed that the solution of the simple heuristic proposed in this paper does not differ significantly from the optimal solution at a significance level of 0.05.

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. Baker KR, Bertrand JWM (1982) A dynamic priority rule for sequencing against due dates. J Oper Manag 3:37–42

    Article  Google Scholar 

  2. Biskup D, Piewitt W (2000) A note on ‘an efficient algorithm for the single-machine tardiness problem’. Int J Prod Econ 66(3):287–292

    Article  Google Scholar 

  3. Elmaghraby SE (1968) The one machine sequencing problem with delay costs. J Ind Eng 19:105–108

    Google Scholar 

  4. Emmons H (1969) One machine scheduling to minimize certain functions of job tardiness. Oper Res 17:701–715

    MATH  MathSciNet  Google Scholar 

  5. Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J SIAM 10:196–210

    MATH  MathSciNet  Google Scholar 

  6. Hirakawa Y (1999) A quick optimal algorithm for sequencing on one machine to minimize total tardiness. Int J Prod Econ 60–61(20):549–555

    Article  Google Scholar 

  7. Kim YD, Yano CA (1994) Minimizing mean tardiness and earliness in single machine scheduling problems with unequal due-dates. Nav Res Log 41(7):913–933

    Article  MATH  Google Scholar 

  8. Kiyuzato L, Ronconi DP, Salamoni R, Tsai CK, Yoshizaki H (2002) Minimizing total tardiness: a case study in an auto parts factory. Int T Oper Res 9(4):371–379

    Article  MATH  MathSciNet  Google Scholar 

  9. Kondakei et al (1994) An efficient algorithm for the single machine tardiness problem. Int J Prod Econ 36(2):213–219

    Article  Google Scholar 

  10. Naidu JT (2003) A note on a well-known dispatching rule to minimize total tardiness. Omega 31(2):137–140

    Article  Google Scholar 

  11. Panneerselvam R (1991) Modelling the single machine scheduling problem to minimize total tardiness and weighted total tardiness. Int J Manage Syst 7(1):37–48

    MathSciNet  Google Scholar 

  12. Schrage LE, Baker KR (1978) Dynamic programming solution for sequencing problems with precedence constraints. Oper Res 26:444–449

    Article  MATH  Google Scholar 

  13. Sen TT, Austin LM, Ghandforoush P (1983) An algorithm for the single-machine sequencing problem to minimize total tardiness. IIE T 15:363–366

    Article  Google Scholar 

  14. Tian ZJ, Ng CT, Cheng TCE (2005) On the single machine total tardiness problem. Eur J Oper Res 165(3):843–846

    Article  MATH  MathSciNet  Google Scholar 

  15. Wilkerson LJ, Irwin JD (1971) An improved algorithm for scheduling independent tasks. AIIE T 3(3):329–345

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Studies, School of Management, Pondicherry University, Pondicherry, 605 014, India

    R. Panneerselvam

Authors
  1. R. Panneerselvam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Panneerselvam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panneerselvam, R. Simple heuristic to minimize total tardiness in a single machine scheduling problem. Int J Adv Manuf Technol 30, 722–726 (2006). https://doi.org/10.1007/s00170-005-0102-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-005-0102-1

Keywords

Search

Navigation