Summary
The problem of scheduling jobs on a single machine with a common due date is one of NP-complete problems. It is to minimize the total earliness and tardiness penalties. This chapter introduces a Dynamical Ant Colony Optimization (DACO) with heuristics for scheduling jobs on a single machine with a common due date. In the proposed algorithm, the parameter of heuristic information is dynamically adjusted. Furthermore, additional heuristics are embedded into DACO as local search to escape from local optima. Compared with other existing approaches in the literature, the proposed algorithm is very useful for scheduling jobs on a single machine with a common due date.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Biskup, D. and Feldmann, M. (2001) Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates, Computers and Operations Research: 28(8) 787-801.
Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP Completeness, W. H. Freeman and Company, San Francisco, California.
Bose, R. (2002) Information theory, coding, and cryptography, McGraw Hill.
Gordon, V., Proth, J.-M. and Chu, C. (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.
Gupta, J. N. D., Lauff, V. and Wernerm F. (2004) Two-machine flow shop problems with nonregular criteria, Journal of Mathematical Modelling and Algorithms: 3 123-151.
Feldmann, M. and Biskup D. (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches, Computers and Industrial Engineering: 44(2) 307-323.
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.
Hall, N. G., Kubiak, W. and Sethi, S. P. (1991) Earliness-tardiness scheduling problem, II: deviation of completion times about a restrictive common due date, Operations Research: 39(5) 847-856.
Hino, C. M., Ronconi, D. P., and Mendes, A. B. (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.
Hoogeveen, J. A. and Velde Van De S. L. (1991) Scheduling around a small common due date, European Journal and Operational Research: 55(2) 237-242.
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.
Mondal, S. A. and Sen, A. K. (2001) Single machine weighted earliness–tardiness penalty problem with a common due date, Computers and Operations Research: 28 649-669.
Lin, S.-W., Chou, S.-Y., and Ying, K.-C. (2007) 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.
Ibarraki T. and Katoh N. (1988) Resource Allocation Problems: The MIT Press: Cambridge, Massachusetts.
Lee, Z.-J., Lee, C.-Y. (2005) A Hybrid Search Algorithm with Heuristics for Resource Allocation Problem, Information sciences: 173 155-167.
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.
Lee, C. Y. and Kim, S. J. (1995) Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights, Computers and Industrial Engineering: 28(2) 231-243.
Liu, M. and Wu, M. (2006) 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.
Jaynes, E. T. (1982) On the rationale of the maximum entropy methods. Proceedings of the IEEE: 70(9) 939-952.
Kahlbacher, H. G. (1993) Scheduling with monotonous earliness and tardiness penalties, European Journal of Operational Research: 64(2) 258-277.
Raghavachari, M. (1988) Scheduling problems with non-regular penalty functions: a review, Operations Research: 25 144-164.
Szwarc, W. (1989) Single-machine scheduling to minimize absolute deviation of completion times from a common due date, Naval Research Logistics: 36 663-673.
Smith, W. E. (1956) Various optimizers for single-stage production, Naval Research Logistics Quarterly: 3 59-66.
Dorigo M. and Sttzle T. (2004). Ant Colony Optimization: The MIT Press.
Lee, C.-Y., Lee, Z.-J. and Su, S.-F. (2005) Ant Colonies With Cooperative Process Applied To Resource Allocation Problem, Journal of the Chinese Institute of Engineers: 28 879-885.
Lee, Z.-J., Lee, C.-Y. and Su, S.-F. (2002) An Immunity Based Ant Colony Optimization Algorithm for Solving Weapon-Target Assignment Problem, Applied Soft Computing 2(1) 39-47.
Lee, Z.-J. and Lee, W.-L. (2003) A Hybrid Search Algorithm of Ant Colony Optimization and Genetic Algorithm Applied to Weapon-Target Assignment Problems, Lecture Notes in Computer Science 2690: 278-285.
Bauer, A. et al. (1999) An ant colony optimization approach for the single machine total tardiness problem, Proceedings of the 1999 Congress on Evolutionary Computation: 2 1445-1450.
Varela, G. N. and Sinclair, M. C. (1999) Ant colony optimization for virtual wavelength path routing and wavelength allocation, Proceedings of the 1999 Congress on Evolutionary Computation: 3 1809-1816.
Dicaro, G. and Dorigo, M. (1998) Mobile agents for adaptive routing, Proceedings of the Thirty-First Hawaii International Conference on System Sciences: 7 74-83.
Yu, I. K., Chou, C. S. and Song,Y. H. (1998) Application of the ant colony search algorithm to short-term generation scheduling problem of thermal units, Proceedings of the 1998 International Conference on Power System Technology: 1 552-556.
Nemes L. and Roska, T. (1995) A CNN model of oscillation and chaos in ant colonies: a case study, IEEE Transactions on Circuits and Systems I, Fundamental Theory and Applications: 42 (10) 741-745.
Pan Q.-K., Tasgetiren M. F. and Liang Y.-C. (2006) Minimizing total earliness and tardiness penalties with a common due date on a single-machine using a discrete particle swarm optimization algorithm, Lecture Notes in Computer Science: 4150 460-467.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Lee, ZJ., Lin, SW., Ying, KC. (2008). A Dynamical Ant Colony Optimization with Heuristics for Scheduling Jobs on a Single Machine with a Common Due Date. In: Xhafa, F., Abraham, A. (eds) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Studies in Computational Intelligence, vol 128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78985-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78985-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78984-0
Online ISBN: 978-3-540-78985-7
eBook Packages: EngineeringEngineering (R0)