Annals of Operations Research

, Volume 180, Issue 1, pp 197-211

First online:

Generating artificial chromosomes with probability control in genetic algorithm for machine scheduling problems

  • Pei-Chann ChangAffiliated withDepartment of Information Management, Yuan-Ze University Email author 
  • , Shih-Hsin ChenAffiliated withDepartment of Electronic Commerce Management, Nanhua University
  • , Chin-Yuan FanAffiliated withDepartment of Industrial Engineering and Management, Yuan-Ze University
  • , V. ManiAffiliated withDepartment of Aerospace Engineering, Indian Institute of Science

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, a novel genetic algorithm is developed by generating artificial chromosomes with probability control to solve the machine scheduling problems. Generating artificial chromosomes for Genetic Algorithm (ACGA) is closely related to Evolutionary Algorithms Based on Probabilistic Models (EAPM). The artificial chromosomes are generated by a probability model that extracts the gene information from current population. ACGA is considered as a hybrid algorithm because both the conventional genetic operators and a probability model are integrated. The ACGA proposed in this paper, further employs the “evaporation concept” applied in Ant Colony Optimization (ACO) to solve the permutation flowshop problem. The “evaporation concept” is used to reduce the effect of past experience and to explore new alternative solutions. In this paper, we propose three different methods for the probability of evaporation. This probability of evaporation is applied as soon as a job is assigned to a position in the permutation flowshop problem. Experimental results show that our ACGA with the evaporation concept gives better performance than some algorithms in the literature.


Evolutionary algorithm with probabilistic models Single machine scheduling Total deviations Flowshop machine scheduling Artificial chromosomes