Abstract
In this paper, an intelligent algorithm for scheduling jobs on a single machine with a common due date is introduced. This problem of scheduling jobs on a single machine, known as NP-complete problem, is against the common due date with respect to earliness and tardiness penalties. In the proposed algorithm, the properties of scheduling jobs on a single machine with a common due date are well derived with ant colony optimization (ACO). Furthermore, the heuristic is embedded into ACO as local search to escape from local optima. Simulation results show that the proposed intelligent algorithm yields the best performance among existing algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baker, K.R., Scudder, G.D.: Sequencing with Earliness and Tardiness Penalties: A Review. Operations Research 38, 22–36 (1990)
Biskup, D., Feldmann, M.: Benchmarks for Scheduling on A Single Machine Against Restrictive and Unrestrictive Common Due Dates. Computers and Operations Research 28, 787–801 (2001)
Bose, R.: Information Theory, Coding, and Cryptography. McGraw Hill, New York (2002)
Gordon, V., Proth, J.-M., Chu, C.: A Survey of the State-of-art of Common Due Date Assignment and Scheduling Research. European Journal of Operational Research 139, 1–25 (2002)
Gupta, J.N.D., Lauff, V., Werner, F.: Two-machine Flow Shop Problems with Nonregular Criteria. Journal of Mathematical Modelling and Algorithms 3, 123–151 (2004)
Liaw, C.F.: A Branch-and-Bound Algorithm for the Single Machine Earliness and Tardiness Scheduling Problem. Computers and Operations Research 26, 679–693 (1999)
Lin, S.W., Chou, S.Y., Ying, K.C.: A Sequential Exchange Approach for Minimizing Earliness-Tardiness Penalties of Single-machine Scheduling with a Common Due Date. European Journal of Operational Search 177, 1294–1301 (2007)
Jaynes, E.T.: On The Rationale of The Maximum Entropy Methods. Proceedings of the IEEE 70, 939–952 (1982)
Hoogeveen, J.A., Van De Velde, S.L.: Scheduling Around a Small Common Due Date. European Journal and Operational Research 55, 237–242 (1991)
Ibarraki, T., Katoh, N.: Resource Allocation Problems. The MIT Press, Cambridge, Massachusetts (1988)
Lee, Z.-J., Lee, C.-Y.: A Hybrid Search Algorithm with Heuristics for Resource Allocation Problem. Information sciences 173, 155–167 (2005)
Feldmann, M., Biskup, D.: Single-machine Scheduling for Minimizing Earliness and Tardiness Penalties by Meta-heuristic Approaches. Computers and Industrial Engineering 44, 307–323 (2003)
James, R.J.W.: Using Tabu Search to Solve the Common Due Date Early/Tardy Machine Scheduling Problem. Computers and Operations Research 24, 199–208 (1997)
Lee, C.Y., Kim, S.J.: Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights. Computers and Industrial Engineering 28, 231–243 (1995)
Liu, M., Wu, M.: Genetic Algorithm for the Optimal Common Due Date Assignment and The Optimal Policy in Parallel Machine Earliness/Tardiness Scheduling Problems. Robotics and Computer-Integrated Manufacturing 22, 279–287 (2006)
Mittenthal, J., Raghavachari, M., Rana, A.I.: A Hybrid Simulated Annealing Approach for Single Machine Scheduling Problems with Non-regular Penalty Functions. Computers and Operations Research 20, 103–111 (1993)
Lin, S.W., Chou, S.Y., Ying, K.C.: Meta-heuristic Approaches for Minimizing Total Earliness and Tardiness Penalties of Single-Machine Scheduling with a Common Due Date. Journal of Heuristics (2007)
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)
Lee, C.-Y., Lee, Z.-J., Su, S.-F.: Ant Colonies With Cooperative Process Applied To Resource Allocation Problem. Journal of the Chinese Institute of Engineers 28, 879–885 (2005)
Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-Tardiness Scheduling Problem, II: Deviation of Completion Times About a Restrictive Common Due Date. Operations Research 39, 847–856 (1991)
Kahlbacher, H.G.: Scheduling with Monotonous Earliness and Tardiness Penalties. European Journal of Operational Research 64, 258–277 (1993)
Mondal, S.A., Sen, A.K.: Single Machine Weighted Earliness-Tardiness Penalty Problem with a Common Due Date. Computers and Operations Research 28, 649–669 (2001)
Raghavachari, M.: Scheduling Problems with Non-regular Penalty Functions: A Review. Operations Research 25, 144–164 (1988)
Szwarc, W.: Single-machine Scheduling to Minimize Absolute Deviation of Completion Times from a Common Due Date. Naval Research Logistics 36, 663–673 (1989)
Hino, C.M., Ronconi, D.P., Mendes, A.B.: Minimizing Earliness and Tardiness Penalties in a Single-machine Problem with a Common Due Date. European Journal of Operational Research 160, 190–201 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, ZJ., Chuang, CC., Ying, KC. (2007). An Intelligent Algorithm for Scheduling Jobs on a Single Machine with a Common Due Date. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_87
Download citation
DOI: https://doi.org/10.1007/978-3-540-74827-4_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74826-7
Online ISBN: 978-3-540-74827-4
eBook Packages: Computer ScienceComputer Science (R0)