A new inter-island genetic operator for optimization problems with block properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4029 LNAI, Issue , 2006, Pages 334-343

  Bozejko, Wojciech ^a   Wodecki, Mieczysław ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; EVOLUTIONARY ALGORITHMS; INFORMATION THEORY; MATHEMATICAL OPERATORS; OPTIMIZATION; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; SCHEDULING;

COEVOLUTIONARY ALGORITHM; GENETIC OPERATOR; OPTIMIZATION PROBLEMS;

PROBLEM SOLVING;

EID: 33746267891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785231_36     Document Type: Conference Paper

References (25)

1. Baker K.R., Scudder C.D., Sequencing with earliness and tardiness penalties: a review, Operations Research 38 (1990) 22-36.
2. Bank J., Werner F., Heuristic algorithm for unrelated parallel machine scheduling with a common due date, relase dates, and linear earliness and tardiness penalties, Mathematical and Computer Modelling 33 (2001) 363-383.
3. Belding T.C, The distributed genetic algorithm revisited, Proceedings of the Sixth International Conference on Genetic Algorithms (L. Eschelman, ed.), Morgan Kaufmann (1995) 114-121
4. Bożejko W., Wodecki M., Parallel genetic algorithm for minimizing total weighted completion time, Lecture Notes in Computer Science No. 3070, Springer Verlag (2004) 400-405.
5. Bożejko W., Grabowski J., Wodecki M., Block approach-tabu search algorithm for single machine total weighted tardiness problem, Computers & Industrial Engineering (2006) (in press).
6. Bożejko W., Wodecki M, Parallel genetic algorithm for the flow shop scheduling problem, Lecture Notes in Computer Science No. 3019, Springer Verlag (2004) 566-571.
7. Bubak M., Sowa M., Objectoriented implementation of parallel genetic algorithms, in High Performance Cluster Computing: Programming and Applications (R. Buyya, ed.), 2, Prentice Hall (1999) 331-349.
8. Feldmann M., Biskup D., Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches, Computers & Industrial Engineering 44 (2003) 307-323.
9. Grabowski J., Wodecki M., A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers and Operations Research, 31 (2004) 1891-1909.
10. Grabowski J., Wodecki M., A very fast tabu search algorithm for job shop problem, in: Rego C., Alidaee B. (editors), Adaptive memory and evolution: tabu search and scatter search, Kluwer Academic Publishers (2004).
11. Gordon V., Proth J.P., Chu C., A survey of the state-of-art of common due date assignment and scheduling research, European Journal of Operational Research 139 (2002) 1-25.
12. Hoogeveen J.A., Van de Velde L.S., A branch and bound algorithm for single-machine earliness-tardiness scheduling with idle time, INFORMS Journal on Computing 8 (1996) 402-412.
13. Kanett J.J., Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics 28 (1981) 643-651.
14. Lee C.Y., Choi J.Y., A generic algorithm for job sequencing problem with distinct due dates and general early-tardy penalty weights, Computers and Operations Research 22 (1995) 857-869.
15. Lenstra J.J., Rinnoy Kan A.H.G., Brucker P., Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
16. Nowicki E., Smutnicki C., A fast tabu search algorithm for the permutation flow shop problem, European Journal of Operational Research, 91 (1996) 160-175.
17. Nowicki E., Smutnicki C., A fast tabu search algorithm for the job shop problem, Management Science, 42 (1996) 797-813.
18. OR-Library: http://people.brunel.ac.uk/mastjjb/jeb/info.html
19. Reeves C. R., Yamada T., Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search, IEEE International Conference on Evolutionary Computation (1998) 230-234.
20. Szwarc W., Adjacent ordering in single machine scheduling with earliness and tardiness penalties. Neval Research Logistics 40 (1993) 229-243.
21. Tanese R., Distribued genetic algorithms, Proc. of the Third Intern. Conf. on Genetic Algorithms (J.D. Schaffer, ed.), Morgan Kaufmann (1989) 434-439
22. T'kindt V., Billaut J-C., Multicriteria scheduling: theory, models and algorithms. Springer Verlag (2002).
23. Valente J.M.S., Alves R.A.F.S., Fildered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time, Computers & Industrial Engineering 48(2) (2005) 363-375.
24. Wan G., Yen B.P.C., Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, European Journal of Operational Research 142 (2002) 271-281.
25. Yano C.A., Kim Y.D., Algorithms for a class of single machine weighted tardiness and earliness problems, European Journal of Operational Research 52 (1991) 167-178.