A hybrid evolutionary algorithm for some discrete optimization problems

Proceedings - 5th International Conference on Intelligent Systems Design and Applications 2005, ISDA '05

Volumn 2005, Issue , 2005, Pages 326-331

  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

DECISION MAKING; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SCHEDULING; TRAVELING SALESMAN PROBLEM;

DISCRETE OPTIMIZATION; PRODUCTION MANAGEMENT; SCHEDULE PLANNING; TABU SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 33846949021     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISDA.2005.8     Document Type: Conference Paper

References (22)

1. Abdul-Razaq T.S., C.N. Potts, L.N. Van Wassenhove, A survey of algorithms for the single machine total weighted tardiness scheduling problem, Discrete Applied Mathematics, 26, 1990, 235-253.
2. Beasley I.E., OR-Library: distributing test problems by electronic mail, Journal of the Operational Research Society 41, 1990, 1069-1072.
3. Congram, R.K., C.N. Potts, S.L. Van de Velde, An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem, IN-FORMS Journal on Computing, Vol. 14, No. 1, 2002, 52-67.
4. Crauwels H.A.J., C.N. Potts, L.N. Van Wassenhove, Local Search Heuristics for the Single machine Total Weighted Tardiness Scheduling Problem, INFORMS Journal on Computing, Vol. 10, No. 3, 1998, 341-350.
5. Den Basten, M., T. Stützle, M. Dorigo, Design of Iterated Local Search Algorithms An Example Application to the Single Machine Total Weighted Tardiness Problem, J.W. Boers et al. (eds.) Evo Worskshop 2001, LNCS 2037, 441-451.
6. Emmons H., One machine sequencing to Minimize Certain Functions of Job Tardiness, Opns. Res. 17, 1969, 701-715.
7. Fisher M.L., A Dual Algorithm for the One Machine Scheduling Problem, Mathematical Programming, 11, 1976, 229-252.
8. Garey M.R., D.S. Johnson, R. Seti, The complexity of flowshop and jonshop scheduling, Mathematics of Operations Research, 1, 1976, 117-129.
9. Grabowski J., M. Wodecki, A very fast search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, 31,2004,1891-1909.
10. Grosso A., F. Della Croce, R. Tadei, An enhanced dynasearch neighborhood for single-machine total weighted tardiness scheduling problem, Operation Research Letters, 32, 2004, 68-72.
11. Ishibuchi H., S. Misaki, H. Tanaka, Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem, European Journal of Operational Research, 81, 1995, 388-398.
12. Johnson S.M., Optimal two and three-stage production schedules with setup times included, Naval Research Logistic Quertely, 1954, 61-68.
13. Lageweg B.J., J.K., Lenstra, A.H.G. Rinnooy Kan, A General Bouding Scheme for the Permutation Flow-Schop Problem, Operations Research, 26, 1978, 53-67.
14. Lenstra J.K., A.G.H. Rinnoy Kan, P.Brucker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, 1, 1977, 343-362.
15. Navaz M., E.E. Enscore Jr, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, 11/1, 1983, 91-95.
16. Nowicki E., C. Smutnicki, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 1996, 160-175.
17. max Flowshop Problem, Computers and Operations Research, 17(3), 1990, 243-253.
18. Osman I., C. Potts, Simulated Annealing for Permutation Flow-Shop Scheduling, OMEGA, 17(6), 1989, 551-557.
19. Potts C.N., L.N. Van Wassenhove, A Branch and Bound Algorithm for the Total Weighted Tardiness Problem, Operations Research, 33, 1985, 177-181.
20. Potts C.N., L.N. Van Wassenhove, Single Machine Tardiness Sequencing Heuristics, HE Transactions, 23, 1991, 346-354.
21. Taillard E., Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 1993, 278-285.
22. Wodecki M., W. Bożejko, Solving the flow shop problem by parallel simulated annealing, Lecture Notes in Computer Science 2328, Springer, 2002, 236-247.