Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem

Applied Mathematics and Computation

Volumn 199, Issue 2, 2008, Pages 590-598

  Kellegöz, Talip ^a   Toklu, Bilal ^b   Wilson, John ^c  

^a KIRIKKALE UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

^c LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

Crossover operators; Genetic algorithms; One machine scheduling; Total weighted tardiness

Indexed keywords

GENETIC ALGORITHMS; INTEGER PROGRAMMING; SCHEDULING ALGORITHMS;

CROSSOVER OPERATORS; ONE MACHINE SCHEDULING; TOTAL WEIGHTED TARDINESS;

PROBLEM SOLVING;

EID: 42649114487     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2007.10.013     Document Type: Article

References (29)

1. Pinedo M. Scheduling: Theory, Algorithms, and Systems (1995), Prentice-Hall, New Jersy
2. French S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop (1982), Herwood, Chichester
3. Lawler E.L. A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics 1 (1977) 331-342
4. Coffman J.R. Computer and Job-Shop Scheduling Theory (1976), Wiley, New York
5. Alidaee B., and Ramakrishnan K.R. A computational experiment of covert-AU class of rules for single machine tardiness scheduling problems. Computers and Industrial Engineering 30 2 (1996) 201-209
6. Emmons H. One-machine sequencing to minimize certain functions of job tardiness. Operations Research 17 (1969) 701-715
7. Rinnooy Kan A.H.G., Lageweg B.J., and Lenstra J.K. Minimizing total costs in one-machine scheduling. Operations Research 25 (1975) 908-927
8. E.L. Lawler, Efficient implementation of dynamic programming algorithms for sequencing problems, Report BW 106, Mathematisch Centrum, Amsterdam, 1979.
9. Fisher M.L. A dual algorithm for the one machine scheduling problem. Mathematical Programming 11 (1976) 229-252
10. Potts C.N., and Van Wassenhove L.N. A branch and bound algorithm for the total weighted tardiness problem. Operations Research 33 (1985) 177-181
11. Akturk M.S., and Yildirim M.B. A new lower bounding scheme for the total weighted tardiness problem. Computers and Operations Research 25 4 (1998) 265-278
12. Cheng T.C.E., Ng C.T., Yuan J.J., and Liu Z.H. Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research 165 (2005) 423-443
13. Crauwels H.A.J., Potts C.N., and Van Wassenhove L.N. Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 10 3 (1998) 341-350
14. Avci S., Akturk M.S., and Storer R.H. A problem space algorithm for single machine weighted tardiness problems. IIE Transactions 35 (2003) 479-486
15. Potts C.N., and Van Wassenhove L.N. Single machine tardiness sequencing heuristics. IIE Transactions 23 (1991) 346-354
16. Holthaus O., and Rajendran C. A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of job. Journal of the Operational Research Society 56 (2005) 947-953
17. Congram R.K., Potts C.N., and Van de Velde S.L. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing 14 1 (2002) 52-67
18. Grosso G., D Croce F., and Tadei R. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters 32 (2004) 68-72
19. Bozejko W., Grabowski J., and Wodecki M. Block approach-tabu search algorithm for single machine total weighted tardiness problem. Computers & Industrial Engineering 50 1-2 (2006) 1-14
20. Gen M., and Cheng R. Genetic Algorithms and Engineering Optimization (2000), John Wiley Sons Inc., USA
21. Goldberg D.E. Genetic Algorithms in Search, Optimization, and Machine Learning (1989), Addison-Wesley, Massachusetts, USA
22. Sarker R., Mohammadian M., and Yao X. Evolutionary Optimization (2002), Kluwer Academic Publishers., NewYork
23. Syswerda G. Schedule Optimization Using Genetic Algorithms. In: Davis L. (Ed). Handbook of Genetic Algorithms (1990), Van Nostrand Reinhold, New York
24. T. Murata, H. Ishibuchi, Performance evaluation of genetic algorithms for flowshop scheduling problems, in: International Conference on Evolutionary Computation, 1994, pp. 812-817.
25. I. Oliver, D. Smith, J. Holland, A study of permutation crossover operators on the traveling salesman problem, in: Proceedings of the Second International Conference on Genetic Algorithms and their Applications, Hillsdale, 1987, pp. 224-230.
26. L. Davis, Applying adaptive algorithms to epistatic domains, in: Proceedings of the International Joint Conference on Artificial Intelligence, 1985, pp.162-164.
27. Goldberg D.E., and Lingle R. Alleles, loci, and the traveling salesman problem. In: Grefenstette J.J. (Ed). Proceedings of the First International Conference on Genetic Algorithms and their Applications (1985), Lowrence Erlbaum, Hillsdale 154-159
28. D. Whitley, T. Starkweather, D.A. Fuquay, Scheduling problems and travelling salesman the genetic edge recombination operator, in: Proceedings of the Third International Conference on Genetic Algorithms, Los Altos, 1989, pp. 133-140.
29. O. Engin, To Increase the performance of flow-shop scheduling problems solving with genetic algorithms: a parameter optimization, Ph.D. Thesis, Istanbul Technical University, Turkey, 2001.