Advertisement

Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm

  • Quan-Ke Pan
  • M. Fatih Tasgetiren
  • Yun-Chia Liang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)

Abstract

In this paper, a discrete particle swarm optimization (DPSO) algorithm is presented to solve the single machine total earliness and tardiness penalties with a common due date. A modified version of HRM heuristic presented by Hino et al. in [1], here we call it MHRM, is also presented to solve the problem. In addition, the DPSO algorithm is hybridized with the iterated local search (ILS) algorithm to further improve the solution quality. The performance of the proposed DPSO algorithm is tested on 280 benchmark instances ranging from 10 to 1000 jobs from the OR Library. The computational experiments showed that the proposed DPSO algorithm has generated better results, in terms of both percentage relative deviations from the upper bounds in Biskup and Feldmann and computational time, than Hino et al. [1].

Keywords

Completion Time Idle Time Percentage Relative Deviation Iterate Local Search Uniform Random Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hino, C.M., Ronconi, D.P., Mendes, A.B.: Minimizing earliness and tardiness penal-ties in a single-machine problem with a common due date. European Journal of Operational Research 160, 190–201 (2005)MATHCrossRefGoogle Scholar
  2. 2.
    Biskup, D., Feldmann, M.: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates. Computers & Operations Research 28, 787–801 (2001)MATHCrossRefGoogle Scholar
  3. 3.
    Cheng, T.C.E., Kahlbacher, H.G.: A proof for the longest-job-first policy in one-machine scheduling. Naval Research Logistics 38, 715–720 (1990)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problems II: weighted- deviation of completion times about a restrictive common due date. Operations Research 39(5), 847–856 (1991)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Feldmann, M., Biskup, D.: Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Computers & Industrial Engineering 44, 307–323 (2003)CrossRefGoogle Scholar
  6. 6.
    Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
  7. 7.
    Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion. In: Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group (PLANSIG 2005), City University, London, UK, pp. 34–43 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Quan-Ke Pan
    • 1
  • M. Fatih Tasgetiren
    • 2
  • Yun-Chia Liang
    • 3
  1. 1.College of Computer ScienceLiaocheng UniversityLiaochengChina
  2. 2.Department of ManagementFatih UniversityIstanbulTurkey
  3. 3.Department of Industrial Engineering and ManagementYuan Ze UniversityTaiwan

Personalised recommendations