A New Inter-island Genetic Operator for Optimization Problems with Block Properties

  • Wojciech Bożejko
  • Mieczysław Wodecki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4029)


Combinatorial optimization problems of scheduling belongs in most cases to the NP-hard class. In this paper we propose a very effective method of construct parallel algorithms based on the island model of coevolutionary algorithm. We apply block properties, which enable the inter-island genetic operator to distribute calculations and shorten communication between processors.


Schedule Problem Goal Function Single Machine Schedule Island Model Parallel Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baker, K.R., Scudder, C.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1990)MATHCrossRefMathSciNetGoogle Scholar
  2. 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, 363–383 (2001)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Belding, T.C.: The distributed genetic algorithm revisited. In: Eschelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 114–121. Morgan Kaufmann, San Francisco (1995)Google Scholar
  4. 4.
    Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. LNCS, vol. 3070, pp. 400–405. Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Bożejko, W., Grabowski, J., Wodecki, M.: Block approach-tabu search algorithm for single machine total weighted tardiness problem. In: Computers & Industrial Engineering (in press, 2006)Google Scholar
  6. 6.
    Bożejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. LNCS, vol. 3019, pp. 566–571. Springer, Heidelberg (2004)Google Scholar
  7. 7.
    Bubak, M., Sowa, M.: Objectoriented implementation of parallel genetic algorithms. In: Buyya, R. (ed.) High Performance Cluster Computing: Programming and Applications, vol. 2, pp. 331–349. Prentice Hall, Englewood Cliffs (1999)Google Scholar
  8. 8.
    Feldmann, M., Biskup, D.: Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Computers & Industrial Engineering 44, 307–323 (2003)CrossRefGoogle Scholar
  9. 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, 1891–1909 (2004)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for job shop problem. In: Rego, C., Alidaee, B. (eds.) Adaptive memory and evolution: tabu search and scatter search, Kluwer Academic Publishers, Dordrecht (2004)Google Scholar
  11. 11.
    Gordon, V., Proth, J.P., Chu, C.: A survey of the state-of-art of common due date assignment and scheduling researc. European Journal of Operational Research 139, 1–25 (2002)MATHCrossRefMathSciNetGoogle Scholar
  12. 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, 402–412 (1996)MATHCrossRefGoogle Scholar
  13. 13.
    Kanett, J.J.: Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics 28, 643–651 (1981)CrossRefGoogle Scholar
  14. 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, 857–869 (1995)MATHCrossRefGoogle Scholar
  15. 15.
    Lenstra, J.J., Rinnoy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)CrossRefGoogle Scholar
  16. 16.
    Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91, 160–175 (1996)MATHCrossRefGoogle Scholar
  17. 17.
    Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the job shop problem. Management Science 42, 797–813 (1996)MATHCrossRefGoogle Scholar
  18. 18.
  19. 19.
    Reeves, C.R., Yamada, T.: Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search. IEEE International Conference on Evolutionary Computation, 230–234 (1998)Google Scholar
  20. 20.
    Szwarc, W.: Adjacent ordering in single machine scheduling with earliness and tardiness penalties. Neval Research Logistics 40, 229–243 (1993)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Tanese, R.: Distribued genetic algorithms. In: Schaffer, J.D. (ed.) Proc. of the Third Intern. Conf. on Genetic Algorithms, pp. 434–439. Morgan Kaufmann, San Francisco (1989)Google Scholar
  22. 22.
    T’kindt, V., Billaut, J.-C.: Multicriteria scheduling: theory, models and algorithms. Springer, Heidelberg (2002)MATHGoogle Scholar
  23. 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), 363–375 (2005)CrossRefGoogle Scholar
  24. 24.
    Wan, G., Yen, B.P.C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. uropean Journal of Operational Research 142, 271–281 (2002)MATHCrossRefMathSciNetGoogle Scholar
  25. 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, 167–178 (1991)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wojciech Bożejko
    • 1
  • Mieczysław Wodecki
    • 2
  1. 1.Institute of Computer Engineering, Control and RoboticsWrocław University of TechnologyWrocławPoland
  2. 2.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Personalised recommendations