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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Feldmann, M., Biskup, D.: Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Computers & Industrial Engineering 44, 307–323 (2003)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pan, QK., Tasgetiren, M.F., Liang, YC. (2006). Minimizing Total Earliness and Tardiness Penalties with a Common Due Date on a Single-Machine Using a Discrete Particle Swarm Optimization Algorithm. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_46
Download citation
DOI: https://doi.org/10.1007/11839088_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)