Skip to main content
SpringerLink
Log in

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem

  • Published:
Computational and Applied Mathematics Aims and scope Submit manuscript

Abstract

This paper addresses minimizing Tardy/Lost penalties with common due dates on a single machine. According to this penalty criterion, if tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. The problem is formulated as an integer programming model, and a heuristic algorithm is constructed. Then, using the proposed dominance rules and lower bounds, we develop two dynamic programming algorithms as well as a branch and bound. Experimental results show that the heuristic algorithm has an average optimality gap less than 2 % in all problem sizes. Instances up to 250 jobs with low variety of process times are optimally solved and for high process time varieties, the algorithms solved all instances up to 75 jobs.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. Minimum Tardy/Lost Ratio

References

  • Baptiste P, Pape C (2005) Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optim 2(1):83–99

    Article  MathSciNet  MATH  Google Scholar 

  • Baptiste P, Sadykov R (2009) On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation. Naval Res Logist 56(6):487–502

    Article  MathSciNet  MATH  Google Scholar 

  • Carrasco RA, Iyengar G, Stein C (2013) Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. Oper Res Lett 41(5):436–441

    Article  MathSciNet  MATH  Google Scholar 

  • Chandra C, Liu Z, He J, Ruohonen T (2014) A binary branch and bound algorithm to minimize maximum scheduling cost. Omega 42(1):9–15

    Article  Google Scholar 

  • Chen B, Potts CN, Woeginger GJ (1998) A review of machine scheduling. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization. Kluwer Academic Publishers, Boston, pp 21–169

    Google Scholar 

  • Cheng TCE, Ng CT, Yuan JJ, Liu ZH (2005) Single machine scheduling to minimize total weighted tardiness. Eur J Oper Res 165:423–443

    Article  MathSciNet  MATH  Google Scholar 

  • Colin EC, Quinino RC (2005) An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions. Comput Oper Res 32(9):2285–2296

    Article  MATH  Google Scholar 

  • Detienne B, Dauzère-Pérès S, Yugma C (2012) An exact approach for scheduling jobs with regular step cost functions on a single machine. Comput Oper Res 39(5):1033–1043

    Article  MathSciNet  MATH  Google Scholar 

  • Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49(1):175–191

    Article  MathSciNet  MATH  Google Scholar 

  • Fathi Y, Nuttle HWL (1990) Heuristics for the Common due date weighted tardiness problem lIE. Transactions 22(3):215–225

    Google Scholar 

  • Federgruen A, Mosheiov G (1994) Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs. Oper Res Lett 16:199–208

    Article  MathSciNet  MATH  Google Scholar 

  • Kahlbacher HG (1993) Scheduling with monotonous earliness and tardiness penalties. Eur J Oper Res 64:258–277

    Article  MATH  Google Scholar 

  • Karakostas G, Kolliopoulos SG, Wang J (2009) An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates. In: Ngo HQ (ed) Computing and combinatorics. Lecture Notes in Computer Science, vol 5609. Springer, Berlin Heidelberg, pp 238–248

  • Kellerer H, Strusevich VA (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theor Comput Sci 369:230–238

    Article  MathSciNet  MATH  Google Scholar 

  • Kethley RB, Alidaee B (2002) Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms. Comput Ind Eng 43:509–528

    Article  Google Scholar 

  • Kianfar K, Moslehi G (2013) A note on “Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date”. Discrete Appl Math 161(13–14):2205–2206

    Article  MathSciNet  MATH  Google Scholar 

  • Kolliopoulos SG, Steiner G (2006) Approximation algorithms for minimizing the total weighted tardiness on a single machine. Theor Comput Sci 355(3):261–273

    Article  MathSciNet  MATH  Google Scholar 

  • Koulamas C (2010) The single-machine total tardiness scheduling problem: Review and extensions. Eur J Oper Res 202(1):1–7

    Article  MathSciNet  MATH  Google Scholar 

  • Lawler EL (1964) On scheduling problems with deferral costs. Manag Sci 11(2):280–288

    Article  MathSciNet  Google Scholar 

  • Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manag Sci 16:77–84

    Article  MATH  Google Scholar 

  • Lenstra JK, Rinnoy-Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343–362

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT (2004) Minimizing total weighted error for imprecise computation tasks and related problems. In: Leung JYT (ed) Handbook of scheduling: algorithms models and performance analysis. CRC Press, Boca Raton, pp 3416–3431

    Google Scholar 

  • Pinedo M (1995) Scheduling: theory algorithms and systems. Prentice Hall, New Jersey

    MATH  Google Scholar 

  • Potts CN, Van Wassenhove LN (1992a) Approximation algorithms for schrduling a single machine to minimize total late work. Oper Res Lett 11(5):261–266

    Article  MathSciNet  MATH  Google Scholar 

  • Potts CN, Van Wassenhove LN (1992b) Single machine scheduling to minimize total late work. Oper Res 40(3):586–595

    Article  MathSciNet  MATH  Google Scholar 

  • Shabtay D (2008) Due date assignment and scheduling a single machine with a general earliness/tardiness cost function. Comput Oper Res 35:1539–1545

    Article  MATH  Google Scholar 

  • Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16(1):3–28

    Article  MathSciNet  MATH  Google Scholar 

  • Slotnick SA (2011) Order acceptance and scheduling: A taxonomy and review. Eur J Oper Res 212(1):1–11

  • Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120–129

    Article  Google Scholar 

  • Yuan J (1992) The NP-hardness of the single machine common due date weighted tardiness problem. Syst Sci Math Sci 5:328–333

    MathSciNet  MATH  Google Scholar 

  • Zhou X, Cai X (1997) General stochastic single-machine scheduling with regular cost functions. Math Comput Model 26(3):95–108

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, University of Isfahan, Isfahan, 81746-73441, Iran

    K. Kianfar

  2. Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, 84156-83111, Iran

    G. Moslehi & A. S. Nookabadi

Authors
  1. K. Kianfar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Moslehi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. S. Nookabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Kianfar.

Additional information

Communicated by Ernesto G. Birgin.

Appendix

Appendix

See Table 11.

Table 11 Summary of running proposed methods on test instances
Full size table

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kianfar, K., Moslehi, G. & Nookabadi, A.S. Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem. Comp. Appl. Math. 37, 867–895 (2018). https://doi.org/10.1007/s40314-016-0370-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40314-016-0370-4

Keywords

Mathematics Subject Classification

Search

Navigation