Skip to main content

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2))

Included in the following conference series:

Abstract

The paper presents the representation of solutions and design of genetic operators for solving of flexible job shop problem (FJSP). Effective methods of representation of problems with the object of further use of genetic operators are considered. Permutation with repetitions are connected with genes which code foreground location of machines for seperate operations. Repairing of chromosomes after crossover for obtaining feasible schedules, as well as the two auxiliary functions IsValid and FindValid are describes. Our computional tests shows that the proposed representation is effective in improving solution quality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bierwith, C.: A Genaralised Permutation Approach to Job Shop Scheduling with Genetic Algorithms. OR Spectrum 17, 89–92 (1995)

    Google Scholar 

  2. Caldeira, J.P., Melicio, F., Rosa, A.: Using a Hybrid Evolutionary-Taboo Algorithm to solve Job Shop Problem. In: Proc. ACM Symposium on Applied Computing, pp. 1446–1451. ACM Press, New York (2004)

    Google Scholar 

  3. Chen, H., Ihlow, J., Lehmann, C.: A Genetic Algorithm for Flexible Job-shop Scheduling. In: Proc. IEEE International Conference on Robotic and Automation, vol. 2, pp. 1120–1125 (1999)

    Google Scholar 

  4. Fang, H.L.: Genetic Algorithms in Timetabling and Scheduling. A Dissertation, Department of Artificial Intelligence University of Edinburgh (1994)

    Google Scholar 

  5. Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multi-objective Evolutionary Optimization for Flexible Job-shop Scheduling Problems. IEEE Transactions on Systems, Man and Cybernetics 32(1), 1–13 (2002)

    Article  Google Scholar 

  6. Kacem, I., Hammadi, S., Borne, P.: Pareto - Optimality Approach for Flexible Job-shop Scheduling Problems: Hybridiztion of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computers in Simulation 60, 245–276 (2002)

    Article  MATH  Google Scholar 

  7. Masghouni, K., Hammadi, S., Borne, P.: Evolution Programs for Job-shop Scheduling. In: Proc. IEEE International Conference on Computational and Simulation, 1997, vol. I, pp. 720–725. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  8. Mattfeld, D.: Evolutionary Search and the Job Shop - Investigations on Genetic Algorithms for Production Scheduling. Springer, Berlin Heidelberg (1996)

    MATH  Google Scholar 

  9. Ong, Z.X., Tay, J.C., Kwoh, C.K.: Applying the Clonal Principle to Find Flexible Job-Shop Schedules. In: Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds.) ICARIS 2005. LNCS, vol. 3627, pp. 442–455. Springer, Heidelberg (2005)

    Google Scholar 

  10. Ortiz-Boyer, D., Hervas-Martinez, C., Garcia-Pedrajas, N.: CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features. J. of Artificial Research 24, 1–48 (2005)

    MATH  Google Scholar 

  11. Ramiro, V., Camino, R., Vela, J.P., Alberto, G.: A Knowledge-based Evolutionary Strategy for Scheduling Problems with Bottlenecks. European J. of Operational Research 145(1), 57–71 (2003)

    Article  MATH  Google Scholar 

  12. Tay, J.C., Ho, N.B.: GENACE: An Efficient Cultural Algorithm for Solving the Flexible Job-Shop Problem. In: Proc. IEEE, Congres of Evolutionary Computation, pp. 1759–1766 (2004)

    Google Scholar 

  13. Tay, J.C., Wibowo, D.: An Effective Chromosome Representation for Evolving Flexible Job Schedule. In: Proc. of AAAI Genetic and Evolutionary Computation, vol. 2, pp. 210–221 (2004)

    Google Scholar 

  14. Wang, L., Zheng, D.Z.: An Effective Hybrid Optimization Strategy for Job-shop Scheduling Problems. Computers & Operation Research 28, 585–596 (2001)

    Article  MATH  Google Scholar 

  15. Witkowski, T., Antczak, P., Antczak, A.: Tabu Search and GRASP Used in Hybrid Procedure for Optimize Flexible Job Shop Problem. In: Proc. 11-th IFSA-World Congress: Fuzzy Logic, Soft Computing and Computional Intelligence, vol. III, pp. 1620–1625 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Witkowski, T., Elzway, S., Antczak, A., Antczak, P. (2007). Representation of Solutions and Genetic Operators for Flexible Job Shop Problem. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques. ICIC 2007. Communications in Computer and Information Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74282-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74282-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74281-4

  • Online ISBN: 978-3-540-74282-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics