Advertisement

A Genetic Algorithm for Some Discrete-Continuous Scheduling Problems

  • Joanna Józefowska
  • Rafal Różycki
  • Jan Węglarz
Conference paper

Abstract

In this paper a Genetic Algorithm (GA) for solving some discrete-continuous scheduling problems is proposed. In this algorithm, each genotype represents a solution which is derived directly from the idea of a feasible sequence rather than being coded as a binary string. Applying suitable genetic operators allows to conduct the searching process in a feasible region only.

Keywords

Genetic Algorithm Mutation Operator Parallel Machine Crossover Operator Genetic Operator 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Józefowska, J., Węglarz, J., Report of the Inst. of Computing Science, Poznań University of Technology, RA-94/003Google Scholar
  2. [2]
    Liepnis, G.E., Hilliard, M.R., AOR 21, 31 (1989)Google Scholar
  3. [3]
    Chuen-Lung, C., Venkateswara, S., Nasser, A.: EJOR 80, 389 (1995)Google Scholar
  4. [4]
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Berlin Heidelberg: Springer-Verlag 1992MATHGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • Joanna Józefowska
    • 1
  • Rafal Różycki
    • 1
  • Jan Węglarz
    • 1
  1. 1.Institute of Computing SciencePoznań University of TechnologyPoznańPoland

Personalised recommendations