Skip to main content
SpringerLink
Log in

A block approach to earliness-tardiness scheduling problems

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, we consider a single-machine job scheduling problem where the objective is to minimize the weighted sum of earliness and tardiness (E/T) penalties of jobs. This problem is consistent with the just-in-time (JIT) production. We propose partitioning of permutation into subsequences (blocks) and replacing sets of moves with its representatives, significantly decreasing the size of the searched neighborhood. Some new properties of the problem and compound moves make eliminating “bad” elements and speeding up calculations possible. These properties allow us to propose a new fast local search algorithm based on a tabu search method. Computational experiments are presented and the results show that the algorithm proposed allows us to obtain the best-known results in a short time.

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, Scudder CD (1990) Sequencing with earliness and tardiness penalties: a review. Oper Res 38:22–36

    Article  MATH  MathSciNet  Google Scholar 

  2. Bank J, Werner F (2001) Heuristic algorithm for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Math Comput Model 33:363–383

    Article  MATH  MathSciNet  Google Scholar 

  3. Bożejko W, Wodecki M (2005) Task realization’s optimization with earliness and tardiness penalties in distributed computation systems. AWIC 2005, LNAI 3528:69–75

    Google Scholar 

  4. Bożejko W, Grabowski J, Wodecki M (2006) Block approach-tabu search algorithm for single-machine total weighted tardiness problem. Comput Ind Eng 50:1–14

    Article  Google Scholar 

  5. Feldmann M, Biskup D (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput Ind Eng 44:307–323

    Article  Google Scholar 

  6. Glover F (1989) Tabu search. Part I. ORSA J Comput 1:190–206

    MATH  MathSciNet  Google Scholar 

  7. Glover F (1990) Tabu search. Part II. ORSA J Comput 2:4–32

    MATH  Google Scholar 

  8. Gordon V, Proth JP, Chu C (2002) A survey of the state-of-art of common due date assignment and scheduling research. Eur J Oper Res 139:1–25

    Article  MATH  MathSciNet  Google Scholar 

  9. Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31:1891–1909

    Article  MATH  MathSciNet  Google Scholar 

  10. Grabowski J, Wodecki M (2005) A very fast tabu search algorithm for the job shop problem. In: Rego C, Alidaee B (ed) Adaptive memory and evolution; tabu search and scatter search. Dordrecht, Kluwer Academic Publishers

    Google Scholar 

  11. Hendel Y, Soud F (2006) Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem. Eur J Oper Res 173:108–119

    Article  MATH  Google Scholar 

  12. Hoogeveen JA, Van de Velde LS (1996) A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time. INFORMS J Comput 8:402–412

    Article  MATH  Google Scholar 

  13. Lawler EL (1977) A “pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Ann Discrete Math 1:331–342

    Article  MathSciNet  Google Scholar 

  14. Lee CY, Choi JY (1995) A generic algorithm for job sequencing problem with distinct due dates and general early-tardy penalty weights. Comput Oper Res 22:857–869

    Article  MATH  Google Scholar 

  15. Kanett JJ (1981) Minimizing the average deviation of job completion times about a common due date. Nav Res Logist 28:643–651

    Article  Google Scholar 

  16. Korman K (1994) A pressing matter. Video Mag 46–50, February

  17. Landis K (1993) Group technology and cellular manufacturing in the Westvaco Los Angeles VH department. Project report in IOM 581, School of Business, University of Souther California

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

    Article  Google Scholar 

  19. Navaz M, Enscore Jr EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA 11/1:91–95

    Article  Google Scholar 

  20. OR Library: http://sprocket.ict.pwr.wroc.pl/~wbo/benchmarks.htm

  21. Schaller J (2004) Single-machine scheduling with early and quadratic tardy penalties. Comput Ind Eng 46:511–532

    Article  Google Scholar 

  22. Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3:59–66

    Article  Google Scholar 

  23. Szwarc W (1993) Adjacent ordering in single-machine scheduling with earliness and tardiness penalties. Nav Res Logist 40:229–243

    Article  MATH  MathSciNet  Google Scholar 

  24. T’kindt V, Billaut J-C (2002) Multicriteria scheduling: theory, models and algorithms. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  25. Tung-I Tsai (2007) A genetic algorithm for solving the single machine earliness/tardiness problem with distinct due dates and ready times. Int J Adv Manuf Technol 32:994–1000

    Article  Google Scholar 

  26. Wan G, Yen BPC (2002) Tabu search for single-machine scheduling with distinct due windows and weighted earliness/tardiness penalties. Eur J Oper Res 142:271–281

    Article  MATH  MathSciNet  Google Scholar 

  27. Valente JMS, Alves RAFS (2005) Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time. Comput Ind Eng 48(2):363–375

    Article  Google Scholar 

  28. Yano CA, Kim YD (1991) Algorithms for a class of single-machine weighted tardiness and earliness problems. Eur J Oper Res 52:167–178

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Joliot-Curie 15, 50-383, Wrocław, Poland

    Mieczysław Wodecki

Authors
  1. Mieczysław Wodecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mieczysław Wodecki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wodecki, M. A block approach to earliness-tardiness scheduling problems. Int J Adv Manuf Technol 40, 797–807 (2009). https://doi.org/10.1007/s00170-008-1395-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1395-7

Keywords

Search

Navigation