Skip to main content

Advertisement

SpringerLink
Log in

Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This study addresses a class of single-machine scheduling problems involving a common due date where the objective is to minimize the total job earliness and tardiness penalties. A genetic algorithm (GA) approach and a simulated annealing (SA) approach utilizing a greedy local search and three well-known properties in the area of common due date scheduling are developed. The developed algorithms enable the starting time of the first job not at zero and were tested using a set of benchmark problems. From the viewpoints of solution quality and computational expenses, the proposed approaches are efficient and effective for problems involving different numbers of jobs, as well as different processing time, and earliness and tardiness penalties.

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

  • Baker, K.R. and G.D. Scudder. (1990). “Sequencing with Earliness and Tardiness Penalties: A Review.” Operations Research 38(1), 22–36.

    Article  MATH  MathSciNet  Google Scholar 

  • Biskup, D. and M. Feldmann. (2001). “Benchmarks for Scheduling on a Single Machine Against Restrictive and Unrestrictive Common Due Dates.”Computers and Operations Research 28(8), 787–801.

    Article  MATH  Google Scholar 

  • Gen, M. and R. Cheng. (1997). Genetic Algorithms and Engineering Design. John Wiley & Sons, New York.

    Google Scholar 

  • Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., MA.

    MATH  Google Scholar 

  • Gordon, V., J.-M. Proth and C. Chu. (2002). “A Survey of the State-of-Art of Common Due Date Assignment and Scheduling Research.” European Journal of Operational Research 139(1), 1–25.

    Article  MATH  MathSciNet  Google Scholar 

  • Gupta, J.N.D., V. Lauff, and F. Werner. (2004). “Two-Machine Flow Shop Problems with Nonregular Criteria.” Journal of Mathematical Modelling and Algorithms 3, 123–151.

    Article  MATH  MathSciNet  Google Scholar 

  • Feldmann, M. and D. Biskup. (2003). “Single-Machine Scheduling for Minimizing Earliness and Tardiness Penalties by Meta-Heuristic Approaches.” Computers and Industrial Engineering 44(2), 307–323.

    Article  Google Scholar 

  • James, R.J.W. (1997). “Using Tabu Search to Solve the Common Due Date Early/Tardy Machine Scheduling Problem.” Computers and Operations Research 24(3), 199–208.

    Article  MATH  MathSciNet  Google Scholar 

  • Hall, N.G., W. Kubiak and S.P. Sethi. (1991). “Earliness-Tardiness Scheduling Problem, II: Deviation of Completion Times About a Restrictive Common Due Date.” Operations Research 39(5), 847–856.

    MATH  MathSciNet  Google Scholar 

  • Hino, C.M., D.P. Ronconi, and A.B. Mendes. (2005). “Minimizing Earliness and Tardiness Penalties in a Single-Machine Problem with a Common Due Date.” European Journal of Operational Research 160(1), 190–201.

    Article  MATH  Google Scholar 

  • Holland, J. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Ann Arbor.

    Google Scholar 

  • Hoogeveen, J.A. and S.L. van de Velde (1991). “Scheduling Around a Small Common Due Date.” European Journal and Operational Research 55(2), 237–242.

    Article  MATH  Google Scholar 

  • Kahlbacher, H.G. (1993). “Scheduling with Monotonous Earliness and Tardiness Penalties.” European Journal of Operational Research 64(2), 258–277.

    Article  MATH  MathSciNet  Google Scholar 

  • Kirkpatrick, S., C.D. Gelatt, Jr., and M.P. Vecchi. (1983). “Optimization by Simulated Annealing.” Science 220, 671–680.

    Article  MathSciNet  Google Scholar 

  • Lee, C.Y. and S.J. Kim. (1995). “Parallel Genetic Algorithms for the Earliness-Tardiness Job Scheduling Problem with General Penalty Weights.” Computers and Industrial Engineering 28(2), 231–243.

    Article  Google Scholar 

  • Liaw, C.-F. (1999). “A Branch-and-Bound Algorithm for the Single Machine Earliness and Tardiness Scheduling Problem.” Computers and Operations Research 26, 679–693.

    Article  MATH  MathSciNet  Google Scholar 

  • Lin, S.-W. and S.-Y. Chou. (2005). “A Sequential Pair Exchange Approach for Solving Single-Machine Scheduling Problems with General Earliness-Tardiness Penalties.” In Proceedings of MISTA 2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications, NY, USA, pp. 299–314.

  • Metropolis, N., A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller. (1953). “Equations of State Calculations by Fast Computing Machines.” Journal of Chemical Physics 21, 1087–1092.

    Article  Google Scholar 

  • Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin.

    MATH  Google Scholar 

  • Mittenthal, J., M. Raghavachari, and A.I. Rana. (1993). “A Hybrid Simulated Annealing Approach for Single Machine Scheduling Problems with Non-Regular Penalty Functions.” Computers and Operations Research 20, 103–111.

    Article  MATH  Google Scholar 

  • Mondal, S.A. and A.K. Sen. (2001). “Single Machine Weighted Earliness–Tardiness Penalty Problem with a Common Due Date.” Computers and Operations Research 28, 649–669.

    Article  MATH  Google Scholar 

  • Raghavachari, M. (1988). “Scheduling Problems with Non-Regular Penalty Functions: A Review.” Operations Research 25, 144–164.

    MATH  MathSciNet  Google Scholar 

  • Smith, W. E. (1956). “Various Optimizers for Single-Stage Production.” Naval Research Logistics Quarterly 3, 59–66.

    MathSciNet  Google Scholar 

  • Szwarc, W. (1989). “Single-Machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due Date.” Naval Research Logistics 36, 663–673.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Management Department, Huafan University 1, Huafan Road, Taipei, 223, Taiwan

    Shih-Wei Lin

  2. Industrial Management Department, National Taiwan University of Science & Technology 43, Keelung Road, Section 4, Taipei, 106, Taiwan

    Shuo-Yan Chou & Shih-Chieh Chen

Authors
  1. Shih-Wei Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shuo-Yan Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shih-Chieh Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shih-Chieh Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, SW., Chou, SY. & Chen, SC. Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date. J Heuristics 13, 151–165 (2007). https://doi.org/10.1007/s10732-006-9002-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-006-9002-2

Keywords

Search

Navigation